The Cook-Levin theorem

MaRDI QIDQ7361443FDO

Authors Frank J. Balbach

Publication date 8 January 2023

Cites work

• An introduction to Kolmogorov complexity and its applications
• Unnamed Publication
• Unnamed Publication
• On the Computational Complexity of Algorithms
• The complexity of theorem-proving procedures
• Theorem Proving in Higher Order Logics
• Weak call-by-value lambda calculus as a model of computation in Coq

Cited in

(1)

• SAT is Not Solvable in Constant Time

This page was built for software: The Cook-Levin theorem