On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant
Hervé FournierSylvain PerifelRémi de Joannis de VerclosPublished in: CoRR (2013)
Keyphrases
- polynomial size
- lower bound
- boolean functions
- dnf formulas
- concept class
- learning theory
- concept classes
- exponential size
- random instances
- upper bound
- upper and lower bounds
- uniform distribution
- branch and bound algorithm
- branch and bound
- np hard
- objective function
- lower and upper bounds
- vc dimension
- knowledge compilation
- sample complexity
- bounded treewidth
- optimal solution
- membership queries
- randomly generated