Construct · 1 fields · 1 citations

P versus NP problem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computational complexity

the open question of whether every problem whose solutions can be checked quickly can also be solved quickly.

In computational complexity, P versus NP problem refers to the open question of whether every problem whose solutions can be checked quickly can also be solved quickly. This meaning comes from Cook (1971) in Proceedings of the third annual ACM symposium on Theory of computing - STOC '71.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how P versus NP problem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

complexity4 fields · 7 citationsjingle · one word, four constructs NP-completeness1 fields · 3 citationsanchor · a standalone construct satisfiability1 fields · 1 citationsanchor · a standalone construct

References

Cook, S. A. (1971). The complexity of theorem-proving procedures. Proceedings of the third annual ACM symposium on Theory of computing - STOC '71. https://doi.org/10.1145/800157.805047

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct