Polynomial Vicinity Circuits and Nonlinear Lower Bounds.
Kenneth W. ReganPublished in: Computational Complexity Conference (1997)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- np hard
- objective function
- lower bounding
- worst case
- optimal solution
- lower and upper bounds
- average case complexity
- circuit design
- statistical queries
- randomly generated problems
- delay insensitive
- min sum
- high speed
- constant factor approximation algorithm