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 16 items.
- Hardness of embedding simplicial complexes in \(\mathbb R^d\) (Q621847) (← links)
- Decision problems for 3-manifolds and their fundamental groups (Q906847) (← links)
- Finding non-orientable surfaces in 3-manifolds (Q1688857) (← links)
- The intersection of subgroups in free groups and linear programming (Q1709789) (← links)
- Identifying lens spaces in polynomial time (Q1743503) (← links)
- The efficient certification of knottedness and Thurston norm (Q2037601) (← links)
- On the hardness of finding normal surfaces (Q2063199) (← links)
- Some conditionally hard problems on links and 3-manifolds (Q2411821) (← links)
- On the complexity of torus knot recognition (Q3120516) (← links)
- Finding non-orientable surfaces in 3-manifolds (Q3132858) (← links)
- About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness (Q3651622) (← links)
- On Conjectures of Andrews and Curtis (Q4609814) (← links)
- (Q5115814) (← links)
- A solution of the decision problem for the Lewis systems S2 and S4, with an application to topology (Q5844608) (← links)
- Computing a link diagram from its exterior (Q6145673) (← links)
- Recognition of Seifert fibered spaces with boundary is in NP (Q6663178) (← links)
