Complexity of Generalized Satisfiability Counting Problems
- 1 February 1996
- journal article
- research article
- Published by Elsevier in Information and Computation
- Vol. 125 (1) , 1-12
- https://doi.org/10.1006/inco.1996.0016
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The complexity of satisfiability problemsPublished by Association for Computing Machinery (ACM) ,1978
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- On sentences which are true of direct unions of algebrasThe Journal of Symbolic Logic, 1951