Completion of partial Latin hypercube designs: NP-completeness and inapproximability (Q683750)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6836574
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Completion of partial Latin hypercube designs: NP-completeness and inapproximability |
scientific article; zbMATH DE number 6836574 |
Statements
Completion of partial Latin hypercube designs: NP-completeness and inapproximability (English)
0 references
9 February 2018
0 references
Latin hypercube design
0 references
maximin design
0 references
NP-completeness
0 references
inapproximability
0 references
0.8241884708404541
0 references
0.7671063542366028
0 references
0.7629914879798889
0 references
0.7591319680213928
0 references
0.7572632431983948
0 references
