New NP-Complete Problems Associated with Lattices.

Shunichi Hayashi Mitsuru Tada

Published in: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2007)

Keyphrases

np complete problems
np complete
graph coloring
phase transition
max cut
hard problems
sat problem
combinatorial problems
satisfiability problem
max sat
constraint satisfaction
computational complexity
randomly generated
search algorithm
decision problems
constraint satisfaction problems
upper bound
np hard