Login / Signup

Sensitivity of probabilistic results on algorithms for NP-complete problems to input distributions.

John V. Franco
Published in: SIGACT News (1985)
Keyphrases
  • np complete problems
  • orders of magnitude
  • phase transition
  • graph coloring
  • optimization problems
  • hard problems
  • learning algorithm
  • computational complexity
  • artificial neural networks
  • np complete
  • space complexity