Lectures related to Stein Algorithm: Polynomial Identity Testing

Explores polynomials, their operations, and the concept of ideals in polynomial rings.

Explores polynomial operations, properties, and subspaces in vector spaces.

Explores Breadth-First Search and Dijkstra's algorithm for finding shortest paths in graphs.

Covers the basics of polynomials, focusing on rings, operations, and properties.

Covers graphical models for probability distributions and factor graphs representation.

Introduces linear combinations in vector spaces, operations, and polynomials of degree 2.

Covers linear transformations, matrices, kernels, and properties of invertible matrices.

Introduces the Master Theorem for analyzing algorithm time complexity through problem subdivision and formula application.

Explores complex roots, polynomials, and factorizations, including roots of unity and the fundamental theorem of algebra.