Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization.
Lijie ChenXin LyuRyan WilliamsPublished in: Electron. Colloquium Comput. Complex. (2020)
Keyphrases
- logic synthesis
- lower bound
- upper bound
- upper and lower bounds
- branch and bound algorithm
- worst case
- branch and bound
- lower and upper bounds
- objective function
- np hard
- vc dimension
- linear programming relaxation
- lower bounding
- learning algorithm
- data sets
- evolutionary algorithm
- sample complexity
- quadratic assignment problem
- optimal cost