Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference11 articles.
1. V. Dahllöf, P. Jonsson, M. Wahlström, Counting satisfying assignments in 2-SAT and 3-SAT, in: Proc. 8th International Computing and Combinatorics Conference, 2002, pp. 535–543
2. Counting models for 2-SAT and 3-SAT formulae;Dahllöf;Theoretical Computer Science,2005
3. A machine program for theorem-proving;Davis;Communications of ACM,1962
4. A computing procedure for quantification theory;Davis;Journal of the ACM,1960
5. Counting the number of solutions for instances of satisfiability;Dubois;Theoretical Computer Science,1991
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Graphical #SAT Algorithm for Formulae with Small Clause Density;Electronic Proceedings in Theoretical Computer Science;2024-08-12
2. Fine-Grained Reductions from Approximate Counting to Decision;ACM Transactions on Computation Theory;2021-06
3. 3-satisfiability reverse analysis method with Hopfield neural network for medical data set;PROCEEDINGS OF INTERNATIONAL CONFERENCE ON ADVANCES IN MATERIALS RESEARCH (ICAMR - 2019);2020
4. Solving and Sampling with Many Solutions;Algorithmica;2019-12-23
5. Fine-grained reductions from approximate counting to decision;Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing;2018-06-20