Login / Signup

P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP.

Jim Kadin
Published in: J. Comput. Syst. Sci. (1989)
Keyphrases
  • computational complexity
  • sparse data
  • case study
  • lower bound
  • high dimensional
  • neural network
  • artificial intelligence
  • data streams
  • special case
  • np complete
  • sparse representation
  • machine intelligence
  • convex sets