On the occurence of null clauses in random instances of Satisfiability
From MaRDI portal
Publication:1208481
DOI10.1016/0166-218X(90)90054-GzbMath0781.68067MaRDI QIDQ1208481
Publication date: 16 May 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Polynomial-average-time satisfiability problems
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- The Pure Literal Rule and Polynomial Average Time
- Exponential Average Time for the Pure Literal Rule
- Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms
This page was built for publication: On the occurence of null clauses in random instances of Satisfiability