I agree that this site is using cookies. You can find further informations here.
X
Merkliste 
 1 Ergebnisse 
 
1

Embeddability of simplicial complexes is undecidable:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,
Filakovský, Marek ; Wagner, Uli ; Zhechev, Stephan - p. 767-785 , 2020
Link: https://dl.acm.org/doi/10.5555/3381089.3381136