 Our result immediately implies a strongly polynomial algorithm for the Submodular Function Minimization problem that makes at most O(n^3) calls to an evaluation oracle .
<coherence>  Our result immediately implies a strongly polynomial algorithm for the Submodular Function Minimization problem that makes at most O(n^3) calls to an evaluation oracle .
 Our result immediately implies a strongly polynomial algorithm that makes at most O(n^3) calls to an evaluation oracle .