The following pages link to (Q3105314):
Displaying 17 items.
- Dehn filling and the geometry of unknotting tunnels (Q357729) (← links)
- Hardness of embedding simplicial complexes in \(\mathbb R^d\) (Q621847) (← links)
- Integer homology 3-spheres admit irreducible representations in \(\mathrm{SL}(2,{\mathbb C})\) (Q1653121) (← links)
- Finding non-orientable surfaces in 3-manifolds (Q1688857) (← links)
- The efficient certification of knottedness and Thurston norm (Q2037601) (← links)
- On the hardness of finding normal surfaces (Q2063199) (← links)
- Frontiers of sphere recognition in practice (Q2098099) (← links)
- New constructions related to the polynomial sphere recognition problem (Q2136838) (← links)
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász (Q2143333) (← links)
- Traversing three-manifold triangulations and spines (Q2190077) (← links)
- The computational complexity of basic decision problems in 3-dimensional topology (Q2481645) (← links)
- On the complexity of torus knot recognition (Q3120516) (← links)
- Computing Heegaard Genus is NP-Hard (Q4604369) (← links)
- (Q5115814) (← links)
- The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex (Q5241237) (← links)
- Tracing compressed curves in triangulated surfaces (Q5919981) (← links)
- Computing a link diagram from its exterior (Q6145673) (← links)
