Login / Signup

A Note on Sparse Sets and the Polynomial-Time Hierarchy.

Ronald V. BookShouwen Tang
Published in: Inf. Process. Lett. (1989)
Keyphrases
  • sparse data
  • special case
  • sparse representation
  • computational complexity
  • worst case
  • case study
  • higher level
  • approximation algorithms
  • np hardness
  • finite sets
  • class hierarchy