Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Hirsch EA (2000) New worst-case upper bounds for SAT. J Autom Reason 24(4):397–420
2. Yamamoto M (2005) An improved O(1.234 m)-time deterministic algorithm for SAT. IEIC Tech Rep 105(499):37–42
3. Monien B, Speckenmeyer E (1985) Solving satisfiability in less than 2n steps. Discret Appl Math 10(3):287–295
4. Brueggemann T, Kern W (2004) An improved local search algorithm for 3-SAT. Theoret Comput Sci 329(1–3):303–313
5. Junping Z, Minghao Y, Chunguang Z (2010) New worst-case upper bound for #2-SAT and #3-SAT with the number of clauses as the parameter. Proceedings of the twenty-fourth AAAI conference on artificial intelligence. AAAI Press, pp 217–222
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Graphical #SAT Algorithm for Formulae with Small Clause Density;Electronic Proceedings in Theoretical Computer Science;2024-08-12