Lower bounds for designs in symmetric spaces.
Noa EidelsteinAlex SamorodnitskyPublished in: Electron. Colloquium Comput. Complex. (2010)
Keyphrases
- lower bound
- upper bound
- design space
- branch and bound algorithm
- branch and bound
- np hard
- objective function
- worst case
- upper and lower bounds
- lower and upper bounds
- design principles
- vc dimension
- data sets
- lower bounding
- randomly generated problems
- optimal solution
- linear programming relaxation
- concept class
- rendezvous search