On a relation between the minimax risk and the phase transitions of compressed recovery.
Samet OymakBabak HassibiPublished in: Allerton Conference (2012)
Keyphrases
- phase transition
- constraint satisfaction
- random constraint satisfaction problems
- combinatorial problems
- np complete
- graph coloring
- satisfiability problem
- randomly generated
- cellular automata
- data structure
- random instances
- sat problem
- hard problems
- deep structure
- random graphs
- stochastic local search
- genetic algorithm
- lower bound
- np complete problems
- evaluation function
- davis putnam
- special case