Lower Bounds for k-DNF Resolution on Random 3-CNFs.
Michael AlekhnovichPublished in: Comput. Complex. (2011)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- learning algorithm
- uniform distribution
- boolean functions
- objective function
- complex valued
- high resolution
- worst case
- learning theory
- np hard
- lower and upper bounds
- membership queries
- concept class
- randomly generated
- classification noise
- upper and lower bounds
- random instances
- agnostic learning
- learning dnf
- equivalence queries
- statistical queries
- linear programming relaxation
- pac learning
- vc dimension
- optimal solution