1/ Apropos of nothing except the randomness of scientific attribution. Ironic when applied to randomness itself. Amusing that in their book "Algorithms to Live By: The Computer Science of Human Decisions," (academia.edu/42264255/Brian…) the following passages appears:
2/"One of the key results on the role of randomness in polynomial identity testing is what’s called the Schwartz–Zippel lemma."
3/and the accompanying citation "See Schwartz, “Fast Probabilistic Algorithms for Verification of
Polynomial Identities”; Zippel, “Probabilistic Algorithms for Sparse Polynomials”;
and DeMillo and Lipton, “A Probabilistic Remark on Algebraic Program Testing.” "
Polynomial Identities”; Zippel, “Probabilistic Algorithms for Sparse Polynomials”;
and DeMillo and Lipton, “A Probabilistic Remark on Algebraic Program Testing.” "
4/Thanks for the citation, but the order of publication is DeMillo-Lipton (1978), Zippel (1979), Schwartz (1980). So why is it not called the DeMillo-Lipton Lemma? Nagging question. I've even seen (in print) that the DeMillo-Lipton algorithm ANTICIPATES a result by Schwartz.
@threadreaderapp unroll
