3 problems

Circuit Distance conjecture. The Circuit Distance problem is NP-hard for polygons.

Consider a $d$-dimensional polyhedron with $f$ facets. A circuit walk is a sequence of points in the polyhedron in which each step follows an elementary vector of the kernel of a d…

Let $P$ be a polyhedron, let its vertices be the endpoints of circuit walks, and call a walk non-revisiting if no facet is left during the walk and then entered again at a later st…