Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Chen, J., Kanj, I., Jia, W.: Vertex cover: further observations and further improvements. Journal of Algorithms 41, 280–301 (2001)
2. Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7, 201–215 (1960)
3. Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and conquer: a simple O(20.288n) independent set algorithm. In: Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 18–25 (2006)
4. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H.Freeman and Company, New York (1979)
5. Van Gelder, A.: A satisfiability tester for non-clausal propositional claculus. Information and Computation 79, 1–21 (1988)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Further improvements for SAT in terms of formula length;Information and Computation;2023-10
2. A Bloom Filter-based Algorithm for Fast Detection of Common Variables;2023 International Conference on Frontiers of Robotics and Software Engineering (FRSE);2023-06
3. Further Improvements for Sat in Terms of Formula Length;SSRN Electronic Journal;2022
4. An improved upper bound for SAT;Theoretical Computer Science;2021-10
5. A Fast Algorithm for SAT in Terms of Formula Length;Theory and Applications of Satisfiability Testing – SAT 2021;2021