On the Hardness of Short and Sign-Compatible Circuit Walks
From MaRDI portal
Publication:6520007
zbMatharXiv:2402.01066MaRDI QIDQ6520007
Laura Sanità, Weston Grewe, Steffen Borgwardt, Sean Kafer, Jon Lee
Publication date: 1 January 1
Analysis of algorithms and problem complexity (68Q25) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Abstract computational complexity for mathematical programming problems (90C60)
This page was built for publication: On the Hardness of Short and Sign-Compatible Circuit Walks