Elementary Lower Bounds for th Length of Refutations.
Hai-Ping KoMark E. NadelPublished in: LPAR (1992)
Keyphrases
- lower bound
- upper bound
- branch and bound
- np hard
- branch and bound algorithm
- worst case
- lower and upper bounds
- school children
- sample complexity
- lower bounding
- upper and lower bounds
- optimal solution
- total length
- optimal cost
- vc dimension
- objective function
- fixed length
- maximum number
- online learning
- polynomial approximation