Login / Signup

On Random Hard Sets for NP.

Ronald V. BookOsamu Watanabe
Published in: Inf. Comput. (1996)
Keyphrases
  • computational complexity
  • np complete
  • uniformly distributed
  • closed sets
  • ordered sets
  • np hard
  • decision making
  • lower bound
  • hard problems
  • computationally hard
  • random instances