On the Hardness of Short and Sign-Compatible Circuit Walks
From MaRDI portal
Publication:6520007
arXiv2402.01066MaRDI QIDQ6520007FDOQ6520007
Laura Sanità, Weston Grewe, Steffen Borgwardt, Sean Kafer, Jon Lee
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)
This page was built for publication: On the Hardness of Short and Sign-Compatible Circuit Walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6520007)
