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

Deeparnab Chakrabarty, Yu Chen, Sanjeev Khanna. A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022. pages 37-48, IEEE, 2021. [doi]

Abstract

Abstract is missing.