Pages that link to "Item:Q1716008"
From MaRDI portal
The following pages link to Hardness of almost embedding simplicial complexes in \(\mathbb {R}^d\) (Q1716008):
Displaying 9 items.
- Hardness of embedding simplicial complexes in \(\mathbb R^d\) (Q621847) (← links)
- Invariants of graph drawings in the plane (Q778122) (← links)
- Embedding into \(l_{\infty }^{2}\) is easy, embedding into \(l_{\infty}^{3}\) is NP-complete (Q938314) (← links)
- On approximability by embeddings of cycles in the plane. (Q1409758) (← links)
- Eliminating higher-multiplicity intersections. III. Codimension 2 (Q2130509) (← links)
- (Q2934634) (← links)
- Eliminating Higher-Multiplicity Intersections, II. The Deleted Product Criterion in the $r$-Metastable Range (Q3132887) (← links)
- (Q4633898) (← links)
- Some `converses' to intrinsic linking theorems (Q6050229) (← links)
