Circuit Lower Bounds from NP-Hardness of MCSP Under Turing Reductions.
Michael SaksRahul SanthanamPublished in: Computational Complexity Conference (2020)
Keyphrases
- np hardness
- lower bound
- np hard
- upper bound
- approximation algorithms
- optimal solution
- scheduling problem
- worst case
- branch and bound
- worst case analysis
- lower and upper bounds
- integer programming
- objective function
- decision problems
- discrete tomography
- mixed integer
- knapsack problem
- vc dimension
- linear program
- integrality gap
- linear programming relaxation
- linear programming
- genetic algorithm
- turing machine