Phase transition in the computational complexity of the shortest common superstring and genome assembly.
Luis Antonio FernándezVictor Martin-MayorDavid YllanesPublished in: CoRR (2022)
Keyphrases
- phase transition
- computational complexity
- np complete
- constraint satisfaction
- satisfiability problem
- randomly generated
- graph coloring
- np hard
- combinatorial problems
- random instances
- cellular automata
- average degree
- sat problem
- shortest path
- constraint satisfaction problems
- random graphs
- hard problems
- deep structure
- special case
- stochastic local search
- np complete problems
- memory requirements
- hamiltonian cycle
- random constraint satisfaction problems
- optimal solution
- magnetic field
- model checking
- boolean satisfiability
- heuristic search