unknotting

Unknotting problem

There are several types of unknotting algorithms. A major open problem is to determine if there is such a polynomial time algorithm. The unknotting problem is known to be in NP, and also in AMcap coAM. Ian Agol has claimed a proof that unknotting is in NPcapco-NP.