Hypertrees in Combinatorics and Graph Theory
Offered By: BIMSA via YouTube
Course Description
Overview
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
理论计算机科学基础 | Introduction to Theoretical Computer SciencePeking University via edX Introducción a la Teoría Combinatoria
Universidad Católica de Murcia via Miríadax 离散数学概论 Discrete Mathematics Generality
Peking University via Coursera Discrete Mathematics
Indian Institute of Technology, Ropar via Swayam Discrete Mathematics
Shanghai Jiao Tong University via Coursera