The following pages link to (Q4633898):
Displaying 6 items.
- Hardness of embedding simplicial complexes in \(\mathbb R^d\) (Q621847) (← links)
- Embedding into \(l_{\infty }^{2}\) is easy, embedding into \(l_{\infty}^{3}\) is NP-complete (Q938314) (← links)
- Hardness of almost embedding simplicial complexes in \(\mathbb {R}^d\) (Q1716008) (← links)
- (Q2934634) (← links)
- Embedding graphs into two-dimensional simplicial complexes (Q5115795) (← links)
- Embedding graphs into two-dimensional simplicial complexes (Q5881549) (← links)
