 A computation of deepest-descent steps has recently been shown to be NP-hard  De Loera et al., arXiv, 2019 . This is a consequence of the hardness of what we call the optimal circuit-neighbor problem (OCNP) for LPs with non-unique optima.
<coherence>  A computation of deepest-descent steps has recently been shown to be NP-hard  De Loera et al., arXiv, 2019 . This is a consequence of the hardness of what we call the optimal circuit-neighbor problem (OCNP) for LPs with non-unique optima.
 A computation of deepest-descent steps has recently been shown to be NP-hard De Loera et al., arXiv, 2019 ), a consequence of the hardness of what we call the optimal circuit-neighbor problem (OCNP) for LPs with non-unique optima.