Deterministic Completion of Rectangular Matrices Using Ramanujan Bigraphs - II: Explicit Constructions and Phase Transitions.
Shantanu Prasad BurnwalMathukumalli VidyasagarKaneenika SinhaPublished in: CoRR (2019)
Keyphrases
- phase transition
- constraint satisfaction
- satisfiability problem
- random constraint satisfaction problems
- np complete
- randomly generated
- combinatorial problems
- hard problems
- cellular automata
- deep structure
- stochastic local search
- singular value decomposition
- sat problem
- graph coloring
- random instances
- np complete problems
- dynamic programming
- linear programming