How reductions to sparse sets collapse the polynomial-time hierarchy: a primer: Part II restricted polynomial-time reductions.

Published in: SIGACT News (1992)

Keyphrases

special case
computational complexity
worst case
finite automata
finite sets
database
np hardness
efficient computation
data sets
high dimensional
scheduling problem
database systems
information systems
sparse data
information retrieval
databases
dnf formulas