YoVDO

Hypertrees in Combinatorics and Graph Theory

Offered By: BIMSA via YouTube

Tags

Combinatorics Courses Discrete Mathematics Courses Graph Theory Courses Algorithms Courses Computational Complexity Courses Hypergraphs Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the concept of hypertrees in this one-hour lecture by Professor Nati Linial, a renowned expert in Combinatorics and Theory of Algorithms from the Hebrew University of Jerusalem. Delve into the intricate world of combinatorial mathematics as presented by a distinguished scholar who has received numerous accolades, including the Inaugural FOCS "Test of Time" Award, the Rothschild Prize, and the Dijkstra Prize. Gain insights from a researcher with over 150 published papers and an invited speaker at the International Congress of Mathematicians. Learn about the applications of geometry and analysis in computational molecular biology and discover how hypertrees contribute to advancing our understanding of complex mathematical structures.

Syllabus

Nati Linial: Hypertrees


Taught by

BIMSA

Related Courses

Information Theory
The Chinese University of Hong Kong via Coursera Intro to Computer Science
University of Virginia via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera