Login / Signup

Taking it to the Limit: On Infinite Variants of NP-Complete Problems.

Tirza HirstDavid Harel
Published in: Computational Complexity Conference (1993)
Keyphrases
  • np complete problems
  • np complete
  • graph coloring
  • phase transition
  • hard problems
  • sat problem
  • combinatorial problems
  • np hard
  • constraint satisfaction problems
  • neural network
  • genetic programming
  • randomly generated