The Optimal Selection of Secondary Indices is NP-Complete.

Gregory Piatetsky-Shapiro

Published in: SIGMOD Rec. (1983)

Keyphrases

optimal selection
np complete
np hard
satisfiability problem
randomly generated
computational complexity
pspace complete
phase transition
polynomial time complexity
data complexity
multi agent
multi agent systems
lower bound
np complete problems