Login / Signup

If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances.

Dan GutfreundRonen ShaltielAmnon Ta-Shma
Published in: Computational Complexity Conference (2005)
Keyphrases
  • worst case
  • databases
  • computational complexity
  • lower bound
  • np complete
  • genetic algorithm
  • learning algorithm