ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P={x∈Rn ⁣:Ax≤b}P = \{\mathbf{x}\in \mathbb{R}^n\colon A\mathbf{x}\leq \mathbf{b}\} be a polytope defined by a matrix A∈Qm×nA\in \mathbb{Q}^{m\times n} and a vector b∈Qm\mathbf{b}\in \mathbb{Q}^m, let s\mathbf{s} and t\mathbf{t} be vertices of PP, and let k∈Z≥0k\in \mathbb{Z}_{\geq 0}. A circuit walk is a walk from s\mathbf{s} to t\mathbf{t} whose steps follow circuit directions of PP. The conjectured decision problem asks whether there is a circuit walk from s\mathbf{s} to t\mathbf{t} of length at most kk.

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

The paper notes that the proof techniques for monotone circuit walks seem likely to extend to the undirected setting but require technical innovation; the claimed NP-hardness for polygons therefore remains open in the supplied source.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.