Search w/in this Title for Titles All Reviews
	AAMAS 2014 International Foundation for Autonomous Agents and Multiagent Systems         Options: Date Reviewed Title Author Publisher Published Date Descending Order Ascending Order     1-1 of 1 reviews Date Reviewed     Bribery in multiple-adversary path-disruption games is hard for the second level of the polynomial hierarchy Marple A., Rey A., Rothe J.  AAMAS 2014 (Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems, Paris, France, May 5-9, 2014) 1375-1376, 2014.  Type: Proceedings Nondeterministic polynomial time (NP) and NP-completeness are by now widely familiar notions within the general computer science (CS) community. Every CS undergraduate knows many examples of NP-complete problems. In contrast, most comp... Jun 25 2015
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy