A note on circuit lower bounds from derandomization.
Scott AaronsonDieter van MelkebeekPublished in: Electron. Colloquium Comput. Complex. (2010)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- np hard
- branch and bound
- objective function
- worst case
- high speed
- lower bounding
- analog circuits
- lower and upper bounds
- logic circuits
- vc dimension
- upper and lower bounds
- circuit design
- real time
- randomly generated problems
- linear programming relaxation
- optimal cost
- quadratic assignment problem
- power reduction
- online algorithms
- steady state
- search algorithm
- learning algorithm