Embeddability in R^3 is NP-hard - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Embeddability in R^3 is NP-hard

(1, 2) , (3) , (4) , (5)
1
2
3
4
5
Not file

Dates and versions

hal-01649774 , version 1 (27-11-2017)

Identifiers

  • HAL Id : hal-01649774 , version 1

Cite

Arnaud de Mesmay, Yoav Rieck, Eric Sedgwick, Martin Tancer. Embeddability in R^3 is NP-hard. ACM-SIAM Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States. ⟨hal-01649774⟩
131 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More