The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
A linear lower bound on the unbounded error probabilistic communication complexity
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
An Introduction to Support Vector Machines and Other Kernel-based Learning Methods
Cristianini, N., & Shawe-Taylor, J. (2000) · doi:10.1017/cbo9780511801389 · Cited by 13,855
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (1971) · Theory of Probability & Its Applications · doi:10.1137/1116025 · Cited by 2,448
An Introduction to Computational Learning Theory
Kearns, M. J., & Vazirani, U. (1994) · doi:10.7551/mitpress/3897.001.0001 · Cited by 1,697
Cited by
Classical deterministic complexity of Edmonds' Problem and quantum entanglement
Gurvits, L. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780545 · Cited by 448
Classical complexity and quantum entanglement
Gurvits, L. (2004) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2004.06.003 · Cited by 295
Metadata
- Authors
- Forster, J.
- Venue
- Journal of Computer and System Sciences
- Publisher
- Elsevier BV
- Published
- 2002-12
- Volume
- 65
- Issue
- 4
- Pages
- 612-625
- ISSN
- 0022-0000 (ISSN-L)
- OpenAlex
- W2143355494
- Cited by
- 181
- References
- 3
- FWCI
- 7.59
- Type
- journal article
- Language
- en
- Open access
- bronze
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: A linear lower bound on the unbounded error probabilistic communication complexity. https://app.cochat.ai/papers/10.1016/s0022-0000(02)00019-3
- The paper
- Forster, J. (2002). A linear lower bound on the unbounded error probabilistic communication complexity. Journal of Computer and System Sciences. https://doi.org/10.1016/s0022-0000(02)00019-3
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.