1 problem

Submodular separation conjecture. For every such $r,d$, there exists a submodular function $f$ such that $f(x)$ is computable in $\mathrm{poly}(n)$ time, $f(x)\leqslant-1$ for ever…