The word problem for the mapping class group in quasi-linear time
Abstract
We give an O(n 3(n))-time algorithm for the word problem in the mapping class group of a compact surface.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.