Hard satisfiable instances for DPLL-type algorithms
From MaRDI portal
Publication:2577593
DOI10.1007/s10958-005-0105-3zbMath1101.68600OpenAlexW2024260528WikidataQ57101178 ScholiaQ57101178MaRDI QIDQ2577593
Publication date: 3 January 2006
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-005-0105-3
Related Items
Cites Work
- Unnamed Item
- Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem
- On the complexity of regular resolution and the Davis-Putnam procedure
- New worst-case upper bounds for SAT
- SAT local search algorithms: Worst-case study
- Algorithms for Sat and upper bounds on their complexity
- Hard examples for resolution
- A sharp threshold in proof complexity
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving