NP-hardness conjecture for unknotting number
Statement
A knot diagram represents a knot, and its unknotting number is the minimum number of crossing changes required to transform it into the unknot. The associated decision problem asks, given a knot diagram and an integer , whether the knot has unknotting number .
Unknotting-number conjecture. The \textsc{unknotting number} problem is NP-hard.
The conjecture asserts computational hardness for a natural knot-theoretic decision problem. The source explains that proving this is difficult because unknotting numbers are known for only a few specific classes of knots, making it hard to rule out unexpected unknotting operations in reductions from -SAT.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.