An elementary proof that linking problems are hard

Shannon Cheng, Anna Chlopecki, Saarah Nazar +1

We give a new, elementary proof of what we believe is the simplest known example of a ``natural'' problem in computational 3-dimensional topology that is $\mathsf{NP}$-hard -- name…