Lower Bounds for Monotone Counting Circuits.
Stasys JuknaPublished in: Electron. Colloquium Comput. Complex. (2014)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- np hard
- lower and upper bounds
- high speed
- analog circuits
- optimal solution
- worst case
- tunnel diode
- objective function
- delay insensitive
- circuit design
- asynchronous circuits
- sample complexity
- quantum computing
- vc dimension
- low cost
- upper and lower bounds
- analog vlsi
- lower bounding
- boolean functions
- logic circuits
- randomly generated problems
- chip design
- neural network
- lateral inhibition
- sample size
- electronic circuits
- digital circuits
- quadratic assignment problem
- linear programming relaxation
- uniform distribution
- theoretical analysis