Login / Signup
Reduction to NP-complete problems by interpretations.
Elias Dahlhaus
Published in:
Logic and Machines (1983)
Keyphrases
</>
np complete problems
np complete
graph coloring
phase transition
hard problems
sat problem
randomly generated
satisfiability problem
neural network
lower bound
search space
upper bound
genetic programming
constraint satisfaction problems