P versus NP problem - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2007-05-24 22:16:31 Complexity classes NP-complete P versus NP problem NP-hard NP Boolean satisfiability problem P Bounded-error probabilistic polynomial NEXPTIME Theoretical computer science Computational complexity theory Applied mathematics		Add to Reading List Source URL: www.cs.umd.edu Download Document from Source Website File Size: 150,28 KB Share Document on Facebook

	1 Doc. Math. J. DMV Games, Complexity Classes, and Approximation Algorithms Joan Feigenbaum DocID: 1oKqW - View Document
	Proc. 23rd Int. Workshop on Description Logics (DL2010), CEUR-WS 573, Waterloo, Canada, Query Answering in the Description Logic S ⋆ Meghyn Bienvenu1 , Thomas Eiter2 , Carsten Lutz1 , 2 ˇ DocID: 1kbPF - View Document
	A Casual Tour Around a Circuit Complexity Bound∗ arXiv:1111.1261v1 [cs.CC] 4 Nov 2011 Ryan Williams† DocID: 18Jpc - View Document
	Interactive proofs with competing teams of no-signaling provers DocID: 13Xht - View Document
	A multiprover interactive proof system for the local Hamiltonian problem Joseph Fitzsimons∗ Thomas Vidick† Abstract DocID: 13PJR - View Document