 computing deepest-descent steps is NP-hard and inapproximable even for 0/ 1 linear programs with a unique optimum which are defined by a totally unimodular constraint matrix .
<clarity>  computing deepest-descent steps is NP-hard and inapproximable even for 0/ 1 linear programs with a unique optimum which are defined by a totally unimodular constraint matrix .
 computing deepest-descent steps is NP-hard and inapproximable even for 0/ 1-LPs with a unique optimum which are defined by a totally unimodular constraint matrix .