Login / Signup

How reductions to sparse sets collapse the polynomial-time hierarchy: a primer; part I: polynomial-time Turing reductions.

Paul Young
Published in: SIGACT News (1992)
Keyphrases
  • special case
  • computational complexity
  • turing machine
  • worst case
  • finite sets
  • real time
  • databases
  • higher level
  • information retrieval
  • approximation algorithms
  • np hardness