Weighted Sum-of-Squares Lower Bounds for Univariate Polynomials Imply VP ≠q VNP.
Pranjal DuttaNitin SaxenaThomas ThieraufPublished in: Comput. Complex. (2024)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- randomly generated problems
- objective function
- optimal solution
- np hard
- weighted sum
- set of randomly generated instances
- lagrange interpolation
- linear programming relaxation
- low order
- order statistics
- upper and lower bounds
- lower and upper bounds
- vc dimension
- sample complexity
- neural network
- genetic algorithm
- machine learning