An Almost Cubic Lower Bound for Depth Three Arithmetic Circuits.
Neeraj KayalChandan SahaSébastien TavenasPublished in: ICALP (2016)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- objective function
- depth information
- np hard
- branch and bound
- optimal solution
- lower and upper bounds
- depth map
- linear programming relaxation
- worst case
- b spline
- digital circuits
- learning algorithm
- upper and lower bounds
- circuit design
- competitive ratio
- arithmetic operations
- tunnel diode