AC0[p] Lower Bounds against MCSP via the Coin Problem.
Alexander GolovnevRahul IlangoRussell ImpagliazzoValentine KabanetsAntonina KolokolovaAvishay TalPublished in: Electron. Colloquium Comput. Complex. (2019)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- objective function
- lower and upper bounds
- np hard
- upper and lower bounds
- optimal solution
- lagrangian relaxation
- credit card
- lower bounding
- running times
- quadratic assignment problem
- max sat
- data sets
- worst case
- optimal cost
- randomly generated problems
- polynomial approximation
- arc consistency
- theoretical analysis
- special case
- similarity measure