A polynomial lower bound on adaptive complexity of submodular maximization
From MaRDI portal
Publication:5144904
DOI10.1145/3357713.3384311OpenAlexW3035443347MaRDI QIDQ5144904
Author name not available (Why is that?)
Publication date: 19 January 2021
Published in: (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.09130
No records found.
No records found.
This page was built for publication: A polynomial lower bound on adaptive complexity of submodular maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144904)
