CPSC 536N: Randomized Algorithms / Lecture 9: Polynomial Identity Testing by the Schwartz-Zippel Lemma (posted 1 February 2012)

By Nicholas Harvey, posted under the byline nickhar on 1 February 2012. The institutional course page links this post as lecture 9 of CPSC 536N: Randomized Algorithms; its scheduled lecture date, 2 February 2012, is distinct from the blog publication date. WordPress.com is the host.

Online text: nickhar.wordpress.com/2012/02/01/lecture-9-polynomial-identity-testing-by-the-schwartz-zippel-lemma/

Cited passages: §1, formal coefficient-based zero and evaluation access; §1.2, Lemma 1 and proof; §1.3, evaluation rule and independent repetition; §1.4, formal polynomials versus induced functions, extension fields and representation limits.