Functional Lower Bounds for Restricted Arithmetic Circuits of Depth Four.
Suryajith ChillaraPublished in: FSTTCS (2021)
Keyphrases
- lower bound
- upper bound
- high speed
- branch and bound algorithm
- branch and bound
- objective function
- depth map
- depth information
- quadratic assignment problem
- upper and lower bounds
- np hard
- delay insensitive
- lower and upper bounds
- worst case
- vc dimension
- quantum computing
- depth images
- optimal cost
- logic circuits
- set of randomly generated instances
- asynchronous circuits
- arithmetic operations
- lower bounding
- data structure
- optimal solution