A polynomial lower bound on adaptive complexity of submodular maximization
type: Item
instance of: scholarly article
title: A polynomial lower bound on adaptive complexity of submodular maximization
DOI: 10.1145/3357713.3384311
published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
publication date: 2021-01-19T00:00:00Z
full work available at URL: https://arxiv.org/abs/2002.09130
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7298237
zbMATH Keywords: adaptive model
zbMATH Keywords: lower bound
zbMATH Keywords: optimization
zbMATH Keywords: submodular
zbMATH Keywords: symmetry gap
MaRDI profile type: Publication
OpenAlex ID: W3035443347
description: scientific article; zbMATH DE number 7298237