Login / Signup

Using Self-Reducibilities to Characterize Polynomial Time

Judy GoldsmithDeborah JosephPaul Young
Published in: Inf. Comput. (1993)
Keyphrases
  • special case
  • computational complexity
  • approximation algorithms
  • finite automata
  • artificial intelligence
  • multiscale
  • np hardness