Quasipolynomial Bounds for Some Problems in Extremal Combinatorics

Offered By: Institute for Advanced Study via YouTube

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!

Explore a concise conference talk on quasipolynomial bounds in extremal combinatorics. Delve into the research presented by Zander Kelley, a postdoctoral member at the Institute for Advanced Study. Gain insights into the latest developments and challenges in this specialized field of mathematics. Learn about the application of quasipolynomial bounds to various problems in extremal combinatorics and understand their significance in advancing mathematical knowledge. Benefit from this 17-minute presentation that offers a focused look at cutting-edge research in combinatorial mathematics.

Syllabus

Quasipolynomial Bounds for Some Problems in Extremal Combinatorics - Zander Kelley

Taught by

Institute for Advanced Study

Related Courses

Aplicaciones de la teoría de grafos a la vida real
Mirí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