Multiply-Recursive Upper Bounds with Higman's Lemma
Sylvain SchmitzPhilippe SchnoebelenPublished in: CoRR (2011)
Keyphrases
- upper bound
- recursive algorithm
- lower bound
- upper and lower bounds
- lower and upper bounds
- worst case
- branch and bound algorithm
- floating point
- johnson lindenstrauss
- tight bounds
- vc dimension
- generalization error
- sample size
- datalog programs
- branch and bound
- tight upper and lower bounds
- training data
- sample complexity
- permutation flowshop
- error probability
- efficiently computable