Counting the number of solutions for instances of satisfiability
Open Access
- 22 April 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 81 (1) , 49-64
- https://doi.org/10.1016/0304-3975(91)90315-s
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Probabilistic approach to the satisfiability problemTheoretical Computer Science, 1991
- On the r,s-SAT satisfiability problem and a conjecture of ToveyDiscrete Applied Mathematics, 1990
- Uniquely solvable quadratic boolean equationsDiscrete Applied Mathematics, 1985
- A simplified NP-complete satisfiability problemDiscrete Applied Mathematics, 1984
- On the unique satisfiability problemInformation and Control, 1982
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979
- On the Complexity of Timetable and Multicommodity Flow ProblemsSIAM Journal on Computing, 1976