Embeddability of Simplicial Complexes is Undecidable

Marek Filakovský, Uli Wagner 0001, Stephan Zhechev. Embeddability of Simplicial Complexes is Undecidable. In Shuchi Chawla 0001, editor, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020. pages 767-785, SIAM, 2020. [doi]

Abstract

Abstract is missing.