A polynomial lower bound on adaptive complexity of submodular maximization (Q5144904)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polynomial lower bound on adaptive complexity of submodular maximization |
scientific article; zbMATH DE number 7298237
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial lower bound on adaptive complexity of submodular maximization |
scientific article; zbMATH DE number 7298237 |
Statements
A polynomial lower bound on adaptive complexity of submodular maximization (English)
0 references
19 January 2021
0 references
adaptive model
0 references
lower bound
0 references
optimization
0 references
submodular
0 references
symmetry gap
0 references
