An almost Cubic Lower Bound for Depth Three Arithmetic Circuits.
Neeraj KayalChandan SahaSébastien TavenasPublished in: Electron. Colloquium Comput. Complex. (2016)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- optimal solution
- lower and upper bounds
- branch and bound
- depth map
- objective function
- np hard
- upper and lower bounds
- online algorithms
- lower bounding
- arithmetic operations
- high speed
- quantum computing
- analog vlsi
- sufficiently accurate
- floating point
- depth information
- lagrangian relaxation
- circuit design
- vc dimension
- logic circuits
- worst case
- input image
- high quality