Length of prime implicants and number of solutions of random CNF formulae
- 28 February 1999
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 215 (1-2) , 1-30
- https://doi.org/10.1016/s0304-3975(95)00184-0
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A General Upper Bound for the Satisfiability Threshold of Randomr-SAT FormulaeJournal of Algorithms, 1997
- Asymptotic Estimates of Stirling NumbersStudies in Applied Mathematics, 1993
- A threshold for unsatisfiabilityPublished by Springer Nature ,1992
- An assumption-based TMSArtificial Intelligence, 1986
- A Machine Program for Theorem ProvingPublished by Springer Nature ,1983
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960
- On Cores and Prime Implicants of Truth FunctionsThe American Mathematical Monthly, 1959
- Minimization of Boolean Functions*Bell System Technical Journal, 1956
- A Way to Simplify Truth FunctionsThe American Mathematical Monthly, 1955
- The Problem of Simplifying Truth FunctionsThe American Mathematical Monthly, 1952