Random 2-SAT and unsatisfiability
- 26 November 1999
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 72 (3-4) , 119-123
- https://doi.org/10.1016/s0020-0190(99)00128-3
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- The longest path in a random graphCombinatorica, 1981
- A linear-time algorithm for testing the truth of certain quantified boolean formulasInformation Processing Letters, 1979