New Ramsey Multiplicity Bounds and Search Heuristics
Offered By: BIMSA via YouTube
Course Description
Overview
Explore a comprehensive lecture on Ramsey multiplicity bounds and search heuristics presented by Professor Tibor Szabó of Freie Universität Berlin. Delve into advanced topics in combinatorics and graph theory, examining their probabilistic, algebraic, and topological connections, as well as their applications in computer science. Learn from Szabó's extensive research background, which includes positions at prestigious institutions such as the Institute for Advanced Study in Princeton, University of Illinois at Urbana-Champaign, ETH Zurich, and McGill University. Gain insights into cutting-edge developments in the field during this hour-long presentation from the Beijing Institute of Mathematical Sciences and Applications (BIMSA) seminar series.
Syllabus
Tibor Szabó: New Ramsey multiplicity bounds and search heuristics
Taught by
BIMSA
Related Courses
Aplicaciones de la teoría de grafos a la vida realMiríadax Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X] Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer