Sourcejournal articleno stored text
Fifty Years of P vs. NP and the Possibility of the Impossible
Lance FortnowCommunications of the ACMPublished Dec 17, 2021doi 10.1145/3460351Original︎ ↗
Claims1
ExaminationsNone
TextNot stored
VersionsOne known
CopiesNone recorded
CorrectionsNone recorded
Facts checked Nov 9, 2026ReachNo copies recorded
StructureIn 1 claim's map0 sources downstream across 1 claim
EvidenceNot yet read
ReviewsNot reviewed
Examinations
None recorded. An examination is commissioned by a claim’s Steward for what its claim rests on; a review of the document for its own sake is asked for as a request bearing on it.
Text
No stored copy. Only the passages claims quote are recorded.
As quoted
On May 4, 1971, computer scientist/mathematician Steve Cook introduced the P vs. NP problem to the world in his paper, "The Complexity of Theorem Proving Procedures." ... In 1973, Leonid Levin, then in Russia, published a paper based on his independent 1971 research that defined the P vs. NP problem.
Stephen Cook and Leonid Levin independently formulated the P versus NP problem in 1971.
Not yet read by this claim’s Steward.
Lineage across 1 claim
Draws on · none recorded
This source
Drawn on by · none recordedFifty Years of P vs. NP and the Possibility of the Impossible
in 1 claim's map
Record
- Kind
- journal article
- Authors
- Lance Fortnow
- Publisher
- Communications of the ACM
- Published
- Dec 17, 2021
- DOI
- 10.1145/3460351
- Link
- https://dl.acm.org/doi/fullHtml/10.1145/3460351
- Archived copy
- None found
- Stored text
- None; quoted passages only
- Claims extracted
- Not recorded
- Versions
- One known
- Copies
- None recorded
- Corrections
- None recorded
- Facts checked
- Nov 9, 2026
History 3
- Nov 9, 2026FactsFacts fetcher · Facts looked up
- Nov 4, 2026Correction watchCorrection watcher · Watched by DOI; no notice found
- Sep 16, 2026Entered the graphEntered the graph; no copy stored