Parallel Submodular Function Minimization
–Neural Information Processing Systems
We consider the parallel complexity of submodular function minimization (SFM). We provide a pair of methods which obtain two new query versus depth tradeoffs a submodular function defined on subsets of n elements that has integer values between M and M. The first method has depth 2 and query complexity
Neural Information Processing Systems
Apr-29-2026, 23:05:54 GMT