A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle.
Maurice J. JansenKenneth W. ReganPublished in: Theor. Comput. Sci. (2008)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- uncertain data
- lower and upper bounds
- np hard
- high speed
- objective function
- depth map
- constant factor
- difference equations
- belief functions
- quantum computing
- delay insensitive
- lower bounding
- decision theory
- worst case
- stability analysis
- robust optimization
- circuit design
- reinforcement learning
- support vector
- optimal solution
- polynomial approximation
- analog vlsi
- tunnel diode