Pages that link to "Item:Q5469952"
From MaRDI portal
The following pages link to The computational complexity of knot genus and spanning area (Q5469952):
Displayed 4 items.
- Hardness of embedding simplicial complexes in \(\mathbb R^d\) (Q621847) (← links)
- Interval identification systems and plane sections of 3-periodic surfaces (Q735623) (← links)
- A random tunnel number one 3-manifold does not fiber over the circle (Q860185) (← links)
- The computational complexity of basic decision problems in 3-dimensional topology (Q2481645) (← links)