The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Computational complexity of optimum multiuser detection
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
Forney, G. D. (1973) · Proceedings of the IEEE · doi:10.1109/proc.1973.9030 · Cited by 5,647
Combinatorial optimization:Algorithms and complexity
Rabiner, L. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164450 · Cited by 3,576
Principles of digital communication and coding
Viterbi, A. J., & Omura, J. K. (1979) · Virtual Defense Library (Ministerio de Defensa) · Cited by 1,427
Spread-Spectrum Communications
Ellersick, F., Schilling, D. L., Cook, C. E., & Milstein, L. B. (1983) · Encyclopedia of Wireless and Mobile Communications · doi:10.1081/e-ewmc2-120043935 · Cited by 679
Cited by
Semidefinite Relaxation of Quadratic Optimization Problems
Luo, Z.-Q., Ma, W.-K., So, A., Ye, Y., & Zhang, S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936019 · Cited by 3,715
Fifty Years of MIMO Detection: The Road to Large-Scale MIMOs
Yang, S., & Hanzo, L. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2475242 · Cited by 814
On the complexity of sphere decoding in digital communications
Jalden, J., & Ottersten, B. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.843746 · Cited by 720
A statistical-mechanics approach to large-system analysis of CDMA multiuser detectors
Tanaka, T. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.804053 · Cited by 562
Randomly Spread CDMA: Asymptotics Via Statistical Physics
Guo, D., & Verdu, S. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.847700 · Cited by 399
Metadata
- Authors
- Verdú, S.
- Venue
- Algorithmica
- Published
- 1989-06
- Volume
- 4
- Issue
- 1-4
- Pages
- 303-312
- ISSN
- 0178-4617 (ISSN-L)
- 1432-0541
- OpenAlex
- W2063089586
- Cited by
- 325
- References
- 6
- FWCI
- 1.99
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Computational complexity of optimum multiuser detection. https://app.cochat.ai/papers/10.1007/bf01553893
- The paper
- Verdú, S. (1989). Computational complexity of optimum multiuser detection. Algorithmica. https://doi.org/10.1007/bf01553893
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.