Cook: theorem-proving complexity and satisfiability reductions

What changed

Encoded polynomial-time nondeterministic computations as satisfiability instances and established a completeness result using the paper’s definition of P-reducibility.

Scientific scope

Cook's 1971 theorem-proving complexity and satisfiability reductions under the paper's computation model.

Evidence

Original sources and institutional historical accounts support the stated contribution. The reading boundary is recorded at each source; this assessment is not an independent scientific verification.

Contributors

• Stephen A. Cook · SCIENCE: Named source contributor to this scoped work; individual labor shares are not measured.

• Cook, The Complexity of Theorem-Proving Procedures, STOC 1971, 151–158, author-hosted original

Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction