Phase transition for the volume of high-dimensional random polytopes.
Gilles BonnetZakhar KabluchkoNicola TurchiPublished in: Random Struct. Algorithms (2021)
Keyphrases
- phase transition
- high dimensional
- random instances
- random constraint satisfaction problems
- randomly generated
- constraint satisfaction
- easy hard easy pattern
- combinatorial problems
- satisfiability problem
- random sat
- np complete
- np complete problems
- feature space
- hard problems
- sat problem
- average degree
- convex hull
- deep structure
- cellular automata
- low dimensional
- nearest neighbor
- similarity search
- stochastic local search
- constraint satisfaction problems
- hamiltonian cycle
- lower bound
- data points
- graph coloring
- random graphs
- small world networks
- high dimensional data