Lower Bounds for Arithmetic Circuits via the Hankel Matrix.
Nathanaël FijalkowGuillaume LagardePierre OhlmannOlivier SerrePublished in: STACS (2020)
Keyphrases
- lower bound
- upper bound
- branch and bound
- upper and lower bounds
- branch and bound algorithm
- objective function
- lower bounding
- np hard
- worst case
- singular value decomposition
- lower and upper bounds
- positive definite
- neural network
- arithmetic operations
- high speed
- search algorithm
- vc dimension
- optimal solution
- circuit design
- optimal cost
- logic synthesis
- analog vlsi
- tunnel diode