An Eassay about Research on Sparse NP Complete Sets.

Juris Hartmanis Stephen R. Mahaney

Published in: MFCS (1980)

Keyphrases

np complete
randomly generated
np hard
constraint satisfaction problems
logical equivalence
sparse data
satisfiability problem
bounded treewidth
data sets
high dimensional
conjunctive queries
phase transition
database
computational complexity
upper bound
lower bound
polynomial time complexity