About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness - Archive ouverte HAL
Communication Dans Un Congrès Année : 2009

About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness

Dates et versions

hal-02092768 , version 1 (08-04-2019)

Identifiants

Citer

Yan Gérard. About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness. Combinatorial Image Analysis, 2009, Playa del Carmen, Mexico. pp.289--301, ⟨10.1007/978-3-642-10210-3_23⟩. ⟨hal-02092768⟩
15 Consultations
0 Téléchargements

Altmetric

Partager

More