Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Polynomial Identity Testing
Graph Chatbot
Related lectures (51)
Stein Algorithm: Polynomial Identity Testing
Explores the Stein algorithm for polynomial identity testing and the minimization of a cut problem.
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.
Graph Algorithms: Ford-Fulkerson and Strongly Connected Components
Discusses the Ford-Fulkerson method and strongly connected components in graph algorithms.
Analyse 2: Division euclidienne
Explores the process of division euclidienne in polynomials, emphasizing the importance of polynomial degrees during operations.
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.
Differential Forms Integration
Covers the integration of differential forms on smooth manifolds, including the concepts of closed and exact forms.
Interlacing Families and Ramanujan Graphs
Log in to Mediaspace to watch this video
Explores interlacing families of polynomials and 1-sided Ramanujan graphs, focusing on their properties and construction methods.
Sparsest Cut: ARV Theorem
Log in to Mediaspace to watch this video
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
Log in to Mediaspace to watch this video
Introduces the basics of polynomials on a field, focusing on definitions, operations, and properties.
Interlacing Families and Ramanujan Graphs
Log in to Mediaspace to watch this video
Explores interlacing families, Ramanujan graphs, and their construction using signed adjacency matrices.
Linear Algebra: Abstract Concepts
Log in to Mediaspace to watch this video
Introduces abstract concepts in linear algebra, focusing on operations with vectors and matrices.
Building Ramanujan Graphs
Log in to Mediaspace to watch this video
Explores the construction of Ramanujan graphs using polynomials and addresses challenges with the probabilistic method.
Polynomials: Definitions and Operations
Log in to Mediaspace to watch this video
Covers the definition and operations of polynomials, including addition and multiplication, degree, coefficients, and their role in algebraic systems.
Differentiable Functions and Lagrange Multipliers
Log in to Mediaspace to watch this video
Covers differentiable functions, extreme points, and the Lagrange multiplier method for optimization.
Sparsest Cut: Leighton-Rao Algorithm
Log in to Mediaspace to watch this video
Covers the Leighton-Rao algorithm for finding the sparsest cut in a graph, focusing on its steps and theoretical foundations.
Directed Networks & Hypergraphs
Log in to Mediaspace to watch this video
Explores directed networks with asymmetric relationships and hypergraphs that generalize graphs by allowing edges to connect any subset of nodes.
Cheeger's Inequalities
Log in to Mediaspace to watch this video
Explores Cheeger's inequalities for random walks on graphs and their implications.
Convergence of Random Walks
Log in to Mediaspace to watch this video
Explores the convergence of random walks on graphs and the properties of weighted adjacency matrices.
Previous
Page 1 of 3
Next
