Lower Bounds on the Sizes of Defining Sets in Full n-Latin Squares and Full Designs.
Nicholas J. CavenaghPublished in: Graphs Comb. (2018)
Keyphrases
- lower bound
- upper bound
- worst case
- branch and bound algorithm
- real time
- objective function
- lower and upper bounds
- branch and bound
- data sets
- lower bounding
- error bounds
- linear programming
- sample complexity
- vc dimension
- query processing
- linear programming relaxation
- quadratic assignment problem
- optimal solution
- min sum