The Computational Complexity of Knot Genus and Spanning Area
Ian Agol, Joel Hass and William Thurston
The proposed argument
The paper combines a Boolean-satisfiability reduction with a normal-surface certificate. Interval pairings encode components of compressed surface data; a weighted extension computes additional component information. A separate metric construction treats spanning area.
Frozen 29-page arXiv v2. The map indexes the supplied claims and bibliography and classifies selected source-backed proof dependencies. The journal text has not been fully collated.
Reading order
Follow the dependencies
Open the full map ↗Select a claim to see its prerequisites and consumers. Edge labels distinguish proof inputs, source references, background and exclusions.
Your independent assessment
Separate hardness from membership; track binary input length, orbit invariants, progress estimates, boundary conditions and compressed output representations.