Computational complexity of optimum multiuser detection (Q1825661)
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: Computational complexity of optimum multiuser detection |
scientific article; zbMATH DE number 4121443
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of optimum multiuser detection |
scientific article; zbMATH DE number 4121443 |
Statements
Computational complexity of optimum multiuser detection (English)
0 references
1989
0 references
NP-complete
0 references
hypothesis testing
0 references
Gaussian communication channels
0 references
maximum-likelihood sequence detection
0 references
code division multiple-access
0 references
