Hardness of almost embedding simplicial complexes in \(\mathbb {R}^d\)

DOI10.1007/s00454-018-0013-1zbMath1415.57016arXiv1703.06305MaRDI QIDQ1716008

Martin Tancer, Arkadij B. Skopenkov

Publication date: 29 January 2019

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.06305

zbMATH Keywords

equivariant map; NP-hard; almost embedding; PL embedding

Mathematics Subject Classification ID

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

57Q35: Embeddings and immersions in PL-topology

05E45: Combinatorial aspects of simplicial complexes