On the Hardness of Short and Sign-Compatible Circuit Walks

MaRDI QIDQ6520007arXivFDO

Authors Steffen Borgwardt, Weston Grewe, Sean Kafer, Jon Lee, Laura Sanità

Mathematics Subject Classification ID

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)