The importance of the P versus NP question

DOI10.1145/602382.602398MaRDI QIDQ3455552zbMATH OpenOpenAlexFDO

Authors Stephen Cook

Publication date 7 December 2015

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/602382.602398

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited in

(4)

• Unconventional computing: do we dream too much?
• Theoretical computer science: computational complexity
• Sufficient condition for polynomial solvability of random 3-CNF formulas
• Computational complexity of the landscape. I.

This page was built for publication: The importance of the P versus NP question

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3455552)