To cheer you up in difficult times 25: some mathematical news! (Part 2)
Combinatorics and more 2021-05-20
Summary:
Topology Quasi-polynomial algorithms for telling if a knot is trivial Marc Lackenby announced a quasi-polynomial time algorithm to decide whether a given knot is the unknot! This is a big breakthrough. This question is known to be both in NP … Continue reading →