Upper Bounds for the Complexity of Sparse and Tally Descriptions.

Vikraman Arvind Johannes Köbler Martin Mundhenk

Published in: Math. Syst. Theory (1996)

Keyphrases

upper bound
worst case
lower bound
branch and bound
space complexity
lower and upper bounds
upper and lower bounds
computational complexity
optimal solution
sparse data
machine learning
bayesian networks
high dimensional
learning theory
compressed sensing
tight bounds