Solving the satisfiability problem by using randomized approach
From MaRDI portal
Publication:1190510
DOI10.1016/0020-0190(92)90177-WzbMath0748.68032MaRDI QIDQ1190510
Publication date: 26 September 1992
Published in: Information Processing Letters (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
Cites Work
- Unnamed Item
- Unnamed Item
- Average time analyses of simplified Davis-Putnam procedures
- Polynomial-average-time satisfiability problems
- Probabilistic performance of a heurisic for the satisfiability problem
- An average case analysis of a resolution principle algorithm in mechanical theorem proving.
- An Analysis of Backtracking with Search Rearrangement
- The Pure Literal Rule and Polynomial Average Time
- CNF-Satisfiability Test by Counting and Polynomial Average Time
- Exponential Average Time for the Pure Literal Rule
- A Computing Procedure for Quantification Theory