An Exponential Value-Oracle Lower Bound for \({k}\)-Submodular Function Minimization
It is shown that minimization in the value-oracle model requires exponentially many oracle queries, so a simple family of submodular functions for every fixed formula is given.