A Note on the Approximability of Deepest-Descent Circuit Steps
From MaRDI portal
Publication:6351860
DOI10.1016/j.orl.2021.02.003zbMath1525.90261arXiv2010.10809MaRDI QIDQ6351860
Andreas Emil Feldmann, Steffen Borgwardt, Martin Koutecký, Cornelius Brand
Publication date: 21 October 2020
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)
This page was built for publication: A Note on the Approximability of Deepest-Descent Circuit Steps