1 problem

Polynomial-time conjecture. For each fixed link $L$, there is a polynomial-time algorithm that decides, for every input link diagram $D$, whether $D\leadsto L$.