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]

@inproceedings{Filakovsky0Z20,
  title = {Embeddability of Simplicial Complexes is Undecidable},
  author = {Marek Filakovský and Uli Wagner 0001 and Stephan Zhechev},
  year = {2020},
  doi = {10.1137/1.9781611975994.47},
  url = {https://doi.org/10.1137/1.9781611975994.47},
  researchr = {https://researchr.org/publication/Filakovsky0Z20},
  cites = {0},
  citedby = {0},
  pages = {767-785},
  booktitle = {Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020},
  editor = {Shuchi Chawla 0001},
  publisher = {SIAM},
  isbn = {978-1-61197-599-4},
}