Explicit Lower Bounds Against Ω(n)-Rounds of Sum-of-Squares.
Max HopkinsTing-Chun LinPublished in: FOCS (2022)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- worst case
- objective function
- np hard
- database
- lower and upper bounds
- branch and bound
- optimal cost
- lower bounding
- upper and lower bounds
- optimal solution
- data sets
- learning algorithm
- neural network
- quadratic assignment problem
- scheduling problem
- search algorithm
- multi dimensional
- information systems
- machine learning
- real time