Login / Signup

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

Yan Gérard
Published in: IWCIA (2009)
Keyphrases
  • np hardness
  • discrete tomography
  • np hard
  • approximation algorithms
  • mixed integer
  • computational complexity
  • special case
  • bayesian networks