Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Brueggemann, T., Kern, W.: An improved deterministic local search algorithm for 3-SAT. Theoretical Computer Science 329(1–3), 303–313 (2004)
2. Lecture Notes in Computer Science;V. Dahllöf,2002
3. Dahllöf, V., Jonsson, P., Wahlström, M.: Counting models for 2-SAT and 3-SAT formulae. Theoretical Computer Science 332(1–3), 265–291 (2005)
4. Dubois, O.: Counting the number of solutions for instances of satisfiability. Theoretical Computer Science 81, 49–64 (1991)
5. Eppstein, D.: Quasiconvex analysis of backtracking algorithms. In: Proceedings of the 15th annual ACM-SIAM symposium on Discrete algorithms (SODA 2004), pp. 788–797 (2004)
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献