The Informational Content of Canonical Disjoint NP-Pairs Christian Glaßer ∗ Alan L. Selman† - Client-to-client protocol - Document - PDFSEARCH.IO

First Page	Meta Content
	The Informational Content of Canonical Disjoint NP-Pairs Christian Glaßer ∗ Alan L. Selman† Add to Reading List Document Date: 2007-08-15 14:41:53 Open Document File Size: 222,81 KB Share Result on Facebook City Buffalo / / Country Germany / / / IndustryTerm propositional proof systems / proof systems / well-behaved proof systems / / Movie D. 2 / / Organization National Science Foundation / Department of Computer Science and Engineering / / Person Alan L. Selman† Liyu Zhang / / / Position Prime Minister / / ProvinceOrState New York / / Technology simulation / / SocialTag Complexity classes NP PP Oracle machine Polynomial P P versus NP problem Matroid Theoretical computer science Computational complexity theory

The Informational Content of Canonical Disjoint NP-Pairs Christian Glaßer ∗ Alan L. Selman†Add to Reading List