Lower Bounds for Planar Arithmetic Circuits.
C. RamyaPratik ShastriPublished in: Electron. Colloquium Comput. Complex. (2023)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- np hard
- objective function
- arithmetic operations
- lower bounding
- logic synthesis
- lower and upper bounds
- high speed
- optimal solution
- analog circuits
- optimal cost
- ground plane
- worst case
- polynomial approximation
- delay insensitive
- randomly generated problems
- high level synthesis
- set of randomly generated instances
- quadratic assignment problem
- planar surfaces
- upper and lower bounds
- vc dimension
- line drawings
- logic circuits
- analog vlsi
- tunnel diode
- neural network