Upper bounds for A(n, 4) and A(n, 6) derived from Delsarte's linear programming bound.
Cees RoosCornelis de VroedtPublished in: Discret. Math. (1982)
Keyphrases
- upper bound
- linear programming
- lower bound
- worst case
- closed form expressions
- tight bounds
- linear program
- upper and lower bounds
- branch and bound algorithm
- np hard
- optimal solution
- lower and upper bounds
- sample size
- error probability
- nonlinear programming
- dynamic programming
- branch and bound
- integer programming
- generalization error
- vc dimension
- data sets
- tight upper and lower bounds
- partition function
- multi class
- special case
- search algorithm
- objective function