About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness (Q3651622)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness |
scientific article |
Statements
About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness (English)
0 references
11 December 2009
0 references
discrete tomography
0 references
NP-complete
0 references
timetable
0 references
flow problems
0 references
