Polynomial solvability of $NP$-complete problems.

Anatoly V. Panyukov

Published in: CoRR (2014)

Keyphrases

np complete problems
np complete
graph coloring
phase transition
hard problems
sat problem
satisfiability problem
combinatorial problems
special case
constraint satisfaction problems
cellular automata
genetic algorithm
multi objective
job shop scheduling