Login / Signup
A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization and Matroid Intersection.
Deeparnab Chakrabarty
Yu Chen
Sanjeev Khanna
Published in:
SIAM J. Comput. (2023)
Keyphrases
</>
lower bound
greedy algorithm
upper bound
objective function
submodular functions
machine learning
combinatorial optimization
reinforcement learning
denoising
energy function
convex optimization
lower and upper bounds