Embeddability of Simplicial Complexes is Undecidable - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Marek Filakovský' in GoogleThis author has not been identified. Look up 'Uli Wagner 0001' in GoogleThis author has not been identified. Look up 'Stephan Zhechev' in Google

runs on WebDSL