Lecture

Polynomial Identity Testing

Related lectures (29)

Stein Algorithm: Polynomial Identity Testing

Explores the Stein algorithm for polynomial identity testing and the minimization of a cut problem.

Interlacing Families and Ramanujan Graphs

Explores interlacing families of polynomials and 1-sided Ramanujan graphs, focusing on their properties and construction methods.

Graphical Models: Representing Probabilistic Distributions

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.

Matroids: Matroid Intersection

Covers the concept of matroids, focusing on matroid intersection and the properties of subsets of a ground set.

Interlacing Families and Ramanujan Graphs

Explores interlacing families, Ramanujan graphs, and their construction using signed adjacency matrices.

Differentiable Functions and Lagrange Multipliers

Covers differentiable functions, extreme points, and the Lagrange multiplier method for optimization.

Sparsest Cut: ARV Theorem

Covers the proof of the Bourgain's ARV Theorem, focusing on the finite set of points in a semi-metric space and the application of the ARV algorithm to find the sparsest cut in a graph.

Polynomials on a Field: Basics and Operations

Introduces the basics of polynomials on a field, focusing on definitions, operations, and properties.

Unweighted Bipartite Matching

Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.

Building Ramanujan Graphs

Explores the construction of Ramanujan graphs using polynomials and addresses challenges with the probabilistic method.

Convergence of Random Walks

Explores the convergence of random walks on graphs and the properties of weighted adjacency matrices.

Linear Algebra: Abstract Concepts

Introduces abstract concepts in linear algebra, focusing on operations with vectors and matrices.

Polynomials: Definitions and Operations

Covers the definition and operations of polynomials, including addition and multiplication, degree, coefficients, and their role in algebraic systems.

Sparsest Cut: Leighton-Rao Algorithm

Covers the Leighton-Rao algorithm for finding the sparsest cut in a graph, focusing on its steps and theoretical foundations.

Graph Algorithms: Ford-Fulkerson and Strongly Connected Components

Discusses the Ford-Fulkerson method and strongly connected components in graph algorithms.

Directed Networks & Hypergraphs

Explores directed networks with asymmetric relationships and hypergraphs that generalize graphs by allowing edges to connect any subset of nodes.

Analyse 2: Division euclidienne

Explores the process of division euclidienne in polynomials, emphasizing the importance of polynomial degrees during operations.

Cheeger's Inequalities

Explores Cheeger's inequalities for random walks on graphs and their implications.

Correlations of the Liouville function

Explores correlations of the Liouville function along deterministic and independent sequences, covering key concepts and theorems.

Polynomials, Division, and Ideals

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