Embeddability of Simplicial Complexes is Undecidable

DOI10.1137/1.9781611975994.47OpenAlexW2996944283MaRDI QIDQ5146816

M. Filakovský, Stephan Zhechev, Uli Wagner

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611975994.47

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

Some `converses' to intrinsic linking theorems ⋮ Extendability of simplicial maps is undecidable

This page was built for publication: Embeddability of Simplicial Complexes is Undecidable