A Polynomial Lower Bound for Testing Monotonicity.
Aleksandrs BelovsEric BlaisPublished in: SIAM J. Comput. (2021)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- objective function
- np hard
- lower bounding
- worst case
- optimal solution
- test cases
- lower and upper bounds
- sufficiently accurate
- neural network
- polynomial approximation
- linear programming relaxation
- software testing
- knapsack problem
- sample size
- software development
- dynamic programming