Tighter Connections between Derandomization and Circuit Lower Bounds.
Marco CarmosinoRussell ImpagliazzoValentine KabanetsAntonina KolokolovaPublished in: APPROX-RANDOM (2015)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- linear programming relaxation
- upper and lower bounds
- high speed
- objective function
- worst case
- lower and upper bounds
- lower bounding
- np hard
- circuit design
- electronic circuits
- analog circuits
- quadratic assignment problem
- analog vlsi
- optimal solution
- sample complexity
- digital circuits
- real time
- cutting plane
- vc dimension
- dynamic programming
- computational complexity
- optimal cost