The Computational Complexity of Knot Genus and Spanning Area¶
Agol, I., Hass, J., & Thurston, W. (2006). The Computational Complexity of Knot Genus and Spanning Area. Transactions of the American Mathematical Society, 358(9), 3821-3850.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Seifert Surface
- Determining genus in more general triangulated three-manifold settings is computationally difficult, which makes the distinction between “a constructed surface” and “a minimal surface” operationally important.
This sourceEstablishes NP-completeness for a general three-manifold knot-genus decision problem and formalizes minimal orientable spanning-surface reasoning.
- Determining genus in more general triangulated three-manifold settings is computationally difficult, which makes the distinction between “a constructed surface” and “a minimal surface” operationally important.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Links previously used in the corpus¶
Before the registry existed this work was also linked 1 other way.
Registry ID ref:c52b88cd1fc6 · see in the full table