Low-depth arithmetic circuit lower bounds via shifted partials.
Prashanth AmireddyAnkit GargNeeraj KayalChandan SahaBhargav ThankeyPublished in: Electron. Colloquium Comput. Complex. (2022)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- high speed
- objective function
- worst case
- electronic circuits
- depth information
- high levels
- np hard
- analog circuits
- upper and lower bounds
- circuit design
- set of randomly generated instances
- polynomial approximation
- randomly generated problems
- logic circuits
- vc dimension
- three dimensional
- depth map
- optimal solution
- low cost
- special case