Hierarchical Hardness Models for SAT
Authors:
- 9 October 2007
- book chapter
- Published by Springer Nature
- p. 696-711
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- March_dl: Adding Adaptive Heuristics and a New Branching StrategyJournal on Satisfiability, Boolean Modeling and Computation, 2006
- Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms2006
- Sparse multinomial logistic regression: fast algorithms and generalization boundsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2005
- Effective Preprocessing in SAT Through Variable and Clause Elimination2005
- Understanding Random SAT: Beyond the Clauses-to-Variables Ratio2004
- Boosting as a Metaphor for Algorithm DesignLecture Notes in Computer Science, 2003
- Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial AuctionsLecture Notes in Computer Science, 2002
- Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction ProblemsJournal of Automated Reasoning, 2000
- SATO: An efficient propositional prover1997
- Generating hard satisfiability problemsArtificial Intelligence, 1996