Amplifying Circuit Lower Bounds against Polynomial Time with Applications.
Richard J. LiptonRyan WilliamsPublished in: Computational Complexity Conference (2012)
Keyphrases
- lower bound
- worst case
- min sum
- upper bound
- np hard
- randomized algorithm
- approximation algorithms
- branch and bound
- branch and bound algorithm
- special case
- lower and upper bounds
- objective function
- quadratic assignment problem
- integrality gap
- computational complexity
- vc dimension
- constant factor
- upper and lower bounds
- equivalence queries
- statistical queries
- high speed
- digital circuits
- lower bounding
- truth table
- approximation guarantees
- circuit design
- optimal cost
- analog vlsi
- online algorithms
- set of randomly generated instances
- polynomial approximation
- electronic circuits
- analog circuits
- error bounds
- optimal solution