A polynomial lower bound on adaptive complexity of submodular maximization.
Wenzheng LiPaul LiuJan VondrákPublished in: STOC (2020)
Keyphrases
- lower bound
- objective function
- average case complexity
- upper bound
- worst case
- branch and bound
- complexity analysis
- polynomial hierarchy
- branch and bound algorithm
- greedy algorithm
- computational complexity
- np hard
- high order
- neural network
- low order
- average case
- upper and lower bounds
- memory requirements
- space complexity
- vapnik chervonenkis dimension
- sufficiently accurate
- special case