An Explicit Lower Bound of 5n - o(n) for Boolean Circuits.
Kazuo IwamaHiroki MorizumiPublished in: MFCS (2002)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- worst case
- real valued
- np hard
- lower and upper bounds
- optimal solution
- boolean functions
- objective function
- high speed
- data sets
- analog circuits
- linear programming
- special case
- sample complexity
- linear programming relaxation
- lower bounding
- delay insensitive
- vlsi circuits
- sufficiently accurate
- tunnel diode