On the hardness of solving edge matching puzzles as SAT or CSP problems
- 22 September 2012
- journal article
- Published by Springer Nature in Constraints
- Vol. 18 (1) , 7-37
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Generating highly balanced sudoku problems as hard problemsJournal of Heuristics, 2010
- Bounding the Phase Transition on Edge Matching Puzzles2009
- Edge Matching Puzzles as Hard SAT/CSP Benchmarks2008
- On the Power of k-Consistency2007
- Symmetry Definitions for Constraint Satisfaction ProblemsConstraints, 2006
- Hiding Satisfying Assignments: Two are Better than OneJournal of Artificial Intelligence Research, 2005
- Rigorous location of phase transitions in hard optimization problemsNature, 2005
- Mapping Many-Valued CNF Formulas to Boolean CNF Formulas2005
- The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘)Journal of the American Mathematical Society, 2004
- MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems1996