$AC^0[p]$ Lower Bounds and NP-Hardness for Variants of MCSP.
Rahul IlangoPublished in: Electron. Colloquium Comput. Complex. (2019)
Keyphrases
- np hardness
- lower bound
- np hard
- approximation algorithms
- upper bound
- branch and bound
- worst case analysis
- optimal solution
- objective function
- worst case
- scheduling problem
- linear programming
- discrete tomography
- integer programming
- integrality gap
- lower and upper bounds
- constraint satisfaction problems
- decision problems
- mixed integer
- weighted constraint satisfaction problems
- linear programming relaxation
- knapsack problem