A super-polynomial lower bound for regular arithmetic formulas.
Neeraj KayalChandan SahaRamprasad SaptharishiPublished in: Electron. Colloquium Comput. Complex. (2013)
Keyphrases
- lower bound
- upper bound
- quantifier free
- branch and bound algorithm
- lower and upper bounds
- np hard
- branch and bound
- optimal solution
- real numbers
- worst case
- first order logic
- average case complexity
- objective function
- arithmetic operations
- rewrite systems
- low order
- polynomial hierarchy
- quantifier elimination
- galois field
- floating point
- statistical queries
- constant factor
- max sat
- horn clauses
- mathematical formulas
- linear programming relaxation
- upper and lower bounds
- online learning