Schwartz–Zippel lemma (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Schwartz–Zippel lemma" in English language version.

refsWebsite

Global rank English rank

2^nd place

11^th place

8^th place

1,185^th place

840^th place

207^th place

136^th place

acm.org

Schwartz 1980. Schwartz, Jacob T. (October 1980). "Fast probabilistic algorithms for verification of polynomial identities" (PDF). Journal of the ACM. 27 (4): 701–717. CiteSeerX 10.1.1.391.1254. doi:10.1145/322217.322225. S2CID 8314102. Retrieved 2008-06-15.
Zippel 1979. Zippel, Richard (1979). "Probabilistic algorithms for sparse polynomials". In Ng, Edward W. (ed.). Symbolic and Algebraic Computation, EUROSAM '79, An International Symposiumon Symbolic and Algebraic Computation, Marseille, France, June 1979, Proceedings. Lecture Notes in Computer Science. Vol. 72. Springer. pp. 216–226. doi:10.1007/3-540-09519-5_73. ISBN 978-3-540-09519-4.
DeMillo & Lipton 1978. DeMillo, Richard A.; Lipton, Richard J. (1978). "A probabilistic remark on algebraic program testing". Information Processing Letters. 7 (4): 193–195. doi:10.1016/0020-0190(78)90067-4.
Grigoriev & Karpinski 1987. Grigoriev, Dima; Karpinski, Marek (1987). "The matching problem for bipartite graphs with polynomially bounded permanents is in NC". Proceedings of the 28th Annual Symposium on Foundations of Computer Science (FOCS 1987), Los Angeles, California, USA, 27-29 October 1987. IEEE Computer Society. pp. 166–172. doi:10.1109/SFCS.1987.56. ISBN 978-0-8186-0807-0. S2CID 14476361.

Schwartz 1980. Schwartz, Jacob T. (October 1980). "Fast probabilistic algorithms for verification of polynomial identities" (PDF). Journal of the ACM. 27 (4): 701–717. CiteSeerX 10.1.1.391.1254. doi:10.1145/322217.322225. S2CID 8314102. Retrieved 2008-06-15.
Grigoriev & Karpinski 1987. Grigoriev, Dima; Karpinski, Marek (1987). "The matching problem for bipartite graphs with polynomially bounded permanents is in NC". Proceedings of the 28th Annual Symposium on Foundations of Computer Science (FOCS 1987), Los Angeles, California, USA, 27-29 October 1987. IEEE Computer Society. pp. 166–172. doi:10.1109/SFCS.1987.56. ISBN 978-0-8186-0807-0. S2CID 14476361.