Login / Signup
[log n] and sparse turing complete sets for NP.
Jim Kadin
Published in:
Computational Complexity Conference (1987)
Keyphrases
</>
worst case
np complete
computational complexity
lower bound
machine intelligence
np hard
sparse data
definite clause
high dimensional
special case
data sets
upper bound
elastic net
set theoretic
sparse coding
image sequences
knowledge base
artificial intelligence