Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract.
Eli Ben-SassonAlessandro ChiesaDaniel GenkinEran TromerPublished in: ITCS (2013)
Keyphrases
- extended abstract
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- constraint propagation
- np complete
- combinatorial problems
- non binary
- np hard
- product configuration
- computational problems
- arc consistency
- search space
- sat problem
- constraint solving
- finite domain
- temporal constraints
- constraint networks
- soft constraints
- efficient computation
- disjunctive temporal
- state space
- constraint optimization
- tractable classes
- backtracking search
- arithmetic constraints
- decomposition methods
- constraint solver
- global constraints
- forward checking
- weighted constraint satisfaction