On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy.
Jin-yi CaiOsamu WatanabePublished in: SIAM J. Comput. (2004)
Keyphrases
- lower bound
- worst case
- min sum
- upper bound
- high speed
- branch and bound
- np hard
- special case
- branch and bound algorithm
- approximation algorithms
- objective function
- hierarchical structure
- randomized algorithm
- constant factor
- optimal solution
- lower and upper bounds
- integrality gap
- circuit design
- upper and lower bounds
- statistical queries
- randomly generated problems
- electronic circuits
- computational complexity
- quadratic assignment problem
- vc dimension
- approximation ratio
- lower bounding
- greedy algorithm
- optimal cost
- error bounds
- analog vlsi