scientific article; zbMATH DE number 7051255

MaRDI QIDQ4633898zbMATH OpenFDO

Authors Martin Tancer, Jiří Matoušek, Uli Wagner

Publication date 6 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=1496863

Mathematics Subject Classification ID

Embeddings and immersions in PL-topology (57Q35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Hardness of embedding simplicial complexes in R^d
• Hardness of almost embedding simplicial complexes in \(\mathbb {R}^d\)
• Geometric complexity of embeddings in R^d
• Embedding dimensions of simplicial complexes on few vertices
• Embeddability in R^3 is NP-hard
• Embeddability of Simplicial Complexes is Undecidable
• Embeddability in \(\mathbb R^3\) is NP-hard
• On the number of simplicial complexes in \(\mathbb{R}^ d\)
• On codimension one embedding of simplicial complexes
• A computationally intractable problem on simplicial complexes

Cited in

(11)

• Hardness of almost embedding simplicial complexes in \(\mathbb {R}^d\)
• Extendability of simplicial maps is undecidable
• scientific article; zbMATH DE number 6381680 (Why is no real title available?)
• Embeddability in \(\mathbb R^3\) is NP-hard
• Embedding graphs into two-dimensional simplicial complexes
• Embeddability in R^3 is NP-hard
• The parameterized complexity of finding a 2-sphere in a simplicial complex
• scientific article; zbMATH DE number 7662167 (Why is no real title available?)
• Hardness of embedding simplicial complexes in R^d
• Geometric embeddability of complexes is \(\exists\mathbb{R}\)-complete
• Embedding into \(l_{\infty }^{2}\) is easy, embedding into \(l_{\infty}^{3}\) is NP-complete

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633898)