A super-polynomial lower bound for regular arithmetic formulas.
Neeraj KayalChandan SahaRamprasad SaptharishiPublished in: STOC (2014)
Keyphrases
- lower bound
- upper bound
- quantifier free
- branch and bound
- branch and bound algorithm
- lower and upper bounds
- worst case
- real numbers
- np hard
- arithmetic operations
- lower bounding
- average case complexity
- objective function
- statistical queries
- galois field
- quantifier elimination
- low order
- mathematical formulas
- upper and lower bounds
- first order logic
- optimal solution
- polynomial hierarchy
- lagrangian relaxation
- sufficiently accurate