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

Embeddability in ℝ3 is NP-hard:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
de Mesmay, Arnaud ; Rieck, Yo'av ; Sedgwick, Eric. - p. 1316-1329 , 2018
Link: https://doi.org/10.1137/1.9781611975031.86