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¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
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