Stephen Cook, original 1971 paper hosted by the author¶
Cook. (1971). Stephen Cook, original 1971 paper hosted by the author.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Cook–Levin Theorem
- Thus a polynomial-time SAT decider would decide every NP language in polynomial time and yield \(P=NP\); the theorem does not claim that such a decider exists.
This sourceOriginal tautology/oracle wording.
- Thus a polynomial-time SAT decider would decide every NP language in polynomial time and yield \(P=NP\); the theorem does not claim that such a decider exists.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Links previously used in the corpus¶
Before the registry existed this work was also linked 1 other way.
Registry ID ref:43c11047560e · see in the full table