Pages that link to "Item:Q3651622"
From MaRDI portal
The following pages link to About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness (Q3651622):
Displaying 2 items.
The following pages link to About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness (Q3651622):
Displaying 2 items.