Tight dynamic problem lower bounds from generalized BMM and OMv.
Ce JinYinzhan XuPublished in: STOC (2022)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- worst case
- lower and upper bounds
- branch and bound
- objective function
- np hard
- dynamic environments
- optimal solution
- randomly generated problems
- data sets
- query processing
- e learning
- data mining
- neural network
- databases
- sample complexity
- upper and lower bounds
- max sat
- database