Lower Bounds for Circuits with Few Modular Gates using Exponential Sums.
Kristoffer Arnsfelt HansenPublished in: Electron. Colloquium Comput. Complex. (2006)
Keyphrases
- lower bound
- logic circuits
- upper bound
- average case complexity
- branch and bound algorithm
- low power
- branch and bound
- average case
- objective function
- tunnel diode
- np hard
- upper and lower bounds
- analog vlsi
- lower and upper bounds
- worst case
- high speed
- vc dimension
- optimal solution
- max sat
- linear complexity
- optimal cost
- delay insensitive
- random variables
- online algorithms
- modular structure
- low cost
- set of randomly generated instances
- modular neural networks
- polynomial approximation
- randomly generated problems
- quadratic assignment problem
- neural network
- sample complexity