Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas.
Neeraj KayalNutan LimayeChandan SahaSrikanth SrinivasanPublished in: STOC (2014)
Keyphrases
- lower bound
- upper bound
- objective function
- branch and bound
- branch and bound algorithm
- quantifier free
- lower and upper bounds
- np hard
- floating point
- upper and lower bounds
- randomly generated problems
- depth information
- arithmetic operations
- optimal solution
- galois field
- average case complexity
- statistical queries
- quadratic assignment problem
- vc dimension
- mathematical formulas
- polynomial hierarchy
- learning theory
- depth map
- worst case