A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization and Matroid Intersection - researchr publication

researchr

You are not signed in
Sign in
Sign up

Deeparnab Chakrabarty, Yu Chen 0039, Sanjeev Khanna. A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization and Matroid Intersection. SIAM Journal on Computing, 52(1):38-66, February 2023. [doi]

Abstract is missing.

runs on WebDSL