A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization (Conference Paper) | NSF PAGES

skip to main content

Citation Details

A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization

Award ID(s):: 2041920 1763514 2008305 1934876

NSF-PAR ID:: 10318718

Author(s) / Creator(s):: Chakrabarty, Deeparnab; Chen, Yu; Khanna, Sanjeev

Date Published:: 2022-02-01

Journal Name:: 62nd IEEE Annual Symposium on Foundations of Computer Science, (FOCS)

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript1.0
Conference Paper:
https://doi.org/10.1109/FOCS52979.2021.00013