Subject
General Computer Science,Theoretical Computer Science
Reference14 articles.
1. A note on disjunctive form tautologies;Bauer;SIGACT News,1973
2. The complexity of theorem proving procedures;Cook;Proc. 3rd ACM STOC,1971
3. On the length of proofs in the propositional calculus;Cook;Proc. 6th ACM STOC,1974
4. A computing procedure for quantification theory;Davis;J. ACM,1960
Cited by
64 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Reflections on Proof Complexity and Counting Principles;Outstanding Contributions to Logic;2021-09-25
2. A Logical Autobiography;Outstanding Contributions to Logic;2021-09-25
3. Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs;computational complexity;2021-08-27
4. Chapter 1. A History of Satisfiability;Frontiers in Artificial Intelligence and Applications;2021-02-02
5. Aussagenlogik;Grundkurs Künstliche Intelligenz;2021