Lower bounds for arithmetic circuits via the Hankel matrix.
Nathanaël FijalkowGuillaume LagardePierre OhlmannOlivier SerrePublished in: Electron. Colloquium Comput. Complex. (2018)
Keyphrases
- lower bound
- upper bound
- optimal solution
- np hard
- branch and bound algorithm
- objective function
- singular value decomposition
- lower and upper bounds
- branch and bound
- upper and lower bounds
- tunnel diode
- quadratic assignment problem
- circuit design
- worst case
- linear programming relaxation
- linear algebra
- sample complexity
- randomly generated problems