Algorithmic complexity: three<i>NP</i>- hard problems in computational statistics (Q3940795)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithmic complexity: threeNP- hard problems in computational statistics |
scientific article; zbMATH DE number 3757660
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic complexity: three<i>NP</i>- hard problems in computational statistics |
scientific article; zbMATH DE number 3757660 |
Statements
Algorithmic complexity: three<i>NP</i>- hard problems in computational statistics (English)
0 references
1982
0 references
algorithmic complexity
0 references
NP-complete
0 references
NP-hard
0 references
cluster analysis
0 references
regression
0 references
subset selection
0 references
design of experiments
0 references
D-optimal
0 references
0 references
