Embeddability in $\mathbb{R}^3$ is NP-hard

zbMath1403.68322arXiv1708.07734MaRDI QIDQ4607974

Martin Tancer, Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick

Publication date: 15 March 2018

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

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Embeddings and immersions in PL-topology (57Q35)

Related Items (5)

New constructions related to the polynomial sphere recognition problem ⋮ Atomic Embeddability, Clustered Planarity, and Thickenability ⋮ The unbearable hardness of unknotting ⋮ Unnamed Item ⋮ Invariants of graph drawings in the plane

This page was built for publication: Embeddability in $\mathbb{R}^3$ is NP-hard