A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints
Kenya UenoPublished in: CoRR (2009)
Keyphrases
- lower bound
- upper bound
- lower and upper bounds
- optimal solution
- objective function
- branch and bound algorithm
- worst case
- np hard
- branch and bound
- vc dimension
- maximum clique
- integer programming formulations
- running times
- linear programming relaxation
- mixed integer
- constant factor
- linear programming
- linear program
- optimal cost
- constrained minimization
- linear arithmetic constraints
- upper and lower bounds
- sample complexity
- constraint programming
- constraint satisfaction
- dynamic programming
- linear constraints
- global constraints
- column generation
- memory requirements
- computational complexity