Sparse Sets in NP-P: EXPTIME versus NEXPTIME

Juris Hartmanis Neil Immerman Vivian Sewelson

Published in: Inf. Control. (1985)

Keyphrases

upper bound
pspace complete
np complete
description logics
sparse data
first order logic
computational complexity
high dimensional
np hard
satisfiability problem
definite clause
database
horn clauses
transitive closure
data integration
machine learning
neural network
databases