Pages that link to "Item:Q2481645"
From MaRDI portal
The following pages link to The computational complexity of basic decision problems in 3-dimensional topology (Q2481645):
Displaying 8 items.
- Hardness of embedding simplicial complexes in \(\mathbb R^d\) (Q621847) (← links)
- The intersection of subgroups in free groups and linear programming (Q1709789) (← links)
- The efficient certification of knottedness and Thurston norm (Q2037601) (← links)
- On the hardness of finding normal surfaces (Q2063199) (← links)
- On the complexity of torus knot recognition (Q3120516) (← links)
- On Conjectures of Andrews and Curtis (Q4609814) (← links)
- (Q5115814) (← links)
- Computing a link diagram from its exterior (Q6145673) (← links)
