Completion of partial Latin Hypercube Designs: NP-completeness and inapproximability - Archive ouverte HAL
Article Dans Une Revue Theoretical Computer Science Année : 2018

Completion of partial Latin Hypercube Designs: NP-completeness and inapproximability

Dates et versions

hal-01702464 , version 1 (06-02-2018)

Identifiants

Citer

Kaourintin Le Guiban, Arpad Rimmel, Marc-Antoine Weisser, Joanna Tomasik. Completion of partial Latin Hypercube Designs: NP-completeness and inapproximability. Theoretical Computer Science, 2018, 715, pp.1 - 20. ⟨10.1016/j.tcs.2018.01.014⟩. ⟨hal-01702464⟩
110 Consultations
0 Téléchargements

Altmetric

Partager

More