Hierarchical Hardness Models for SAT
From MaRDI portal
Publication:3523084
DOI10.1007/978-3-540-74970-7_49zbMath1145.68534OpenAlexW2114600785MaRDI QIDQ3523084
Holger H. Hoos, Kevin Leyton-Brown, Lin Xu
Publication date: 2 September 2008
Published in: Principles and Practice of Constraint Programming – CP 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74970-7_49
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
ASlib: a benchmark library for algorithm selection ⋮ aspeed: Solver scheduling via answer set programming ⋮ Practical performance models of algorithms in evolutionary program induction and other domains ⋮ Algorithm runtime prediction: methods \& evaluation ⋮ Towards a reference model for timetabling and rostering ⋮ A self-adaptive multi-engine solver for quantified Boolean formulas
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
- Generating hard satisfiability problems
- Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
- SATO: An efficient propositional prover
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: Hierarchical Hardness Models for SAT
