Arithmetic Circuit Lower Bounds via Maximum-Rank of Partial Derivative Matrices.
Mrinal KumarGaurav MaheshwariJayalal SarmaPublished in: ACM Trans. Comput. Theory (2016)
Keyphrases
- singular value decomposition
- lower bound
- singular values
- low rank approximation
- upper bound
- high speed
- np hard
- branch and bound algorithm
- objective function
- lower and upper bounds
- branch and bound
- micron cmos
- vc dimension
- floating point
- upper and lower bounds
- worst case
- optimal solution
- maximum number
- arithmetic operations
- maximum likelihood
- circuit design
- online algorithms
- analog circuits
- optimal cost
- electronic circuits
- learning algorithm