A polynomial lower bound on adaptive complexity of submodular maximization

Wenzheng Li, Paul Liu, Jan Vondrák. A polynomial lower bound on adaptive complexity of submodular maximization. In Konstantin Makarychev, Yury Makarychev, Madhur Tulsiani, Gautam Kamath 0001, Julia Chuzhoy, editors, Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020. pages 140-152, ACM, 2020. [doi]

Abstract

Abstract is missing.