Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Bansal, N., Raman, V.: Upper bounds for MaxSat: Further improved. In: Proc. of the 10th ISAAC (1999)
2. Dahllöf, V., Jonsson, P., Wahlstrm, M.: Counting Satisfying Assignments in 2-SAT and 3-SAT. In: Proc. of COCOON, pp. 535–543 (2002)
3. Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7(1), 201–215 (1960)
4. Hirsch, E.A.: New worst-case upper bounds for SAT. Journal of Automated Reasoning, Special Issue II on Satisfiability in Year 2000 (2000);
5. A preliminary version appeared in Proceedings of SODA 1998 (1998)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献