The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Probabilistic algorithms for sparse polynomials
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
A Fast Monte-Carlo Test for Primality
Solovay, R., & Strassen, V. (1977) · SIAM Journal on Computing · doi:10.1137/0206006 · Cited by 635
Algorithms and Complexity: New Directions and Recent Results
Traub, J. F. (1976) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 427
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
Brown, W. S. (1971) · Journal of the ACM · doi:10.1145/321662.321664 · Cited by 295
Multivariate Polynomial Factorization
Musser, D. R. (1975) · Journal of the ACM · doi:10.1145/321879.321890 · Cited by 102
Cited by
Ciphertext-Policy Attribute-Based Encryption
Bethencourt, J., Sahai, A., & Waters, B. (2007) · 2007 IEEE Symposium on Security and Privacy (SP '07) · doi:10.1109/sp.2007.11 · Cited by 5,131
The NP-completeness column: An ongoing guide
Johnson, D. S. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90020-9 · Cited by 794
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
Kabanets, V., & Impagliazzo, R. (2004) · computational complexity · doi:10.1007/s00037-004-0182-6 · Cited by 378
Arithmetic Circuits: A Survey of Recent Results and Open Questions
Shpilka, A., & Yehudayoff, A. (2010) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000039 · Cited by 363
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Metadata
- Authors
- Zippel, R.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1979
- Pages
- 216-226
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1599026900
- Cited by
- 1,101
- References
- 4
- FWCI
- 5.01
- Type
- conference paper
- 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: Probabilistic algorithms for sparse polynomials. https://app.cochat.ai/papers/10.1007/3-540-09519-5_73
- The paper
- Zippel, R. (1979). Probabilistic algorithms for sparse polynomials. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-09519-5_73
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.