NP-completeness column
Statement
Garey–Johnson; Computers and Intractability; algorithm design. Proved in ZFC.
Source
Donald E. Knuth Prize 2010. Garey–Johnson; Computers and Intractability; algorithm design. Proved in ZFC.
Domains
computer-science
Garey–Johnson; Computers and Intractability; algorithm design. Proved in ZFC.
Donald E. Knuth Prize 2010. Garey–Johnson; Computers and Intractability; algorithm design. Proved in ZFC.
computer-science
Canonical: https://axiom.tanaakk.com/theorem/david-johnson-knuth-2010/