On the Locality of Some NP-Complete Problems.

Leonid Barenboim

Published in: ICALP (2) (2012)

Keyphrases

np complete problems
np complete
graph coloring
phase transition
sat problem
hard problems
decision problems
satisfiability problem
neural network
scheduling problem
search algorithm
computational complexity
np hard
randomly generated