Lower Bounds for DNF-refutations of a Relativized Weak Pigeonhole Principle.
Albert AtseriasMoritz MüllerSergi OlivaPublished in: Computational Complexity Conference (2013)
Keyphrases
- lower bound
- upper bound
- boolean functions
- learning algorithm
- uniform distribution
- branch and bound
- branch and bound algorithm
- worst case
- lower and upper bounds
- learning theory
- objective function
- np hard
- linear programming relaxation
- concept class
- statistical queries
- membership queries
- optimal cost
- agnostic learning
- online algorithms
- vc dimension
- theorem prover
- theoretical analysis