Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems.
Eli Ben-SassonAlessandro ChiesaDaniel GenkinEran TromerPublished in: IACR Cryptol. ePrint Arch. (2012)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- np complete
- constraint propagation
- constraint programming
- search space
- combinatorial problems
- np hard
- constraint solving
- non binary
- efficient computation
- computational problems
- arc consistency
- constraint networks
- arithmetic constraints
- product configuration
- constraint problems
- forward checking
- binary constraints
- backtracking search
- pseudo boolean optimization
- soft constraints
- decomposition methods
- path consistency
- global constraints
- temporal constraints
- constraint graph
- constraint optimization
- state space
- special case
- disjunctive constraints
- lower bound
- finding optimal solutions
- set bounds propagation
- search algorithm