Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference9 articles.
1. The complexity of theorem-proving procedures;Cook,1971
2. A computing procedure for quantification theory;Davis;J. Assoc. Comput. Mach.,1960
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Further improvements for SAT in terms of formula length;Information and Computation;2023-10
2. Further Improvements for Sat in Terms of Formula Length;SSRN Electronic Journal;2022
3. An improved upper bound for SAT;Theoretical Computer Science;2021-10
4. Chapter 2. CNF Encodings;Frontiers in Artificial Intelligence and Applications;2021-02-02
5. A Fast Algorithm for SAT in Terms of Formula Length;Theory and Applications of Satisfiability Testing – SAT 2021;2021