There are no Fully Space Constructible Functions Between log log n and log n.

Andrzej Szepietowski

Published in: Inf. Process. Lett. (1987)

Keyphrases

log log
lower bound
worst case
alphabet size
low dimensional
databases
heavy hitters
linear combination
search space
artificial neural networks
database
upper bound
case study
vector space
input space
decision trees
data mining