The Complexity of Theorem-Proving Procedures
NP-completeness, and SAT as the first complete problem
Read it
- 7 sections
- 0 figures
- 0 equations
- 8 references
- cited by 0 here
- difficulty 4 of 5
- the publisher's page
Contents
Its place here
No other paper in this corpus cites it and it cites none of them.