![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/a/a8/Unknots.svg/640px-Unknots.svg.png&w=640&q=50)
Unknotting problem
Determining whether a knot is the unknot / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Unknotting problem?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
In mathematics, the unknotting problem is the problem of algorithmically recognizing the unknot, given some representation of a knot, e.g., a knot diagram. There are several types of unknotting algorithms. A major unresolved challenge is to determine if the problem admits a polynomial time algorithm; that is, whether the problem lies in the complexity class P.
Unsolved problem in mathematics:
Can unknots be recognized in polynomial time?
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/a/a8/Unknots.svg/165px-Unknots.svg.png)
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/9/98/Thistlethwaite_unknot.svg/640px-Thistlethwaite_unknot.svg.png)