A Super-Quadratic Lower Bound for Depth Four Arithmetic Circuits.
Nikhil GuptaChandan SahaBhargav ThankeyPublished in: Computational Complexity Conference (2020)
Keyphrases
- lower bound
- objective function
- upper bound
- branch and bound
- lower and upper bounds
- branch and bound algorithm
- high speed
- optimal solution
- depth information
- np hard
- depth map
- upper and lower bounds
- pairwise
- neural network
- logic synthesis
- polynomial approximation
- quantum computing
- lower bounding
- sufficiently accurate
- floating point
- sample complexity
- infrared
- computational complexity
- similarity measure