First Page | Document Content | |
---|---|---|
Date: 2013-08-12 10:39:14Complexity classes NP-hard P versus NP problem NP P Bounded-error probabilistic polynomial Oracle machine Reduction Time complexity Theoretical computer science Computational complexity theory Applied mathematics | THE P VERSUS NP PROBLEM STEPHEN COOKAdd to Reading ListSource URL: www.claymath.orgDownload Document from Source WebsiteFile Size: 172,07 KBShare Document on Facebook |