Quasipolynomial Bounds for Some Problems in Extremal Combinatorics
Institute for Advanced Study via YouTube
Learn EDR Internals: Research & Development From The Masters
Master AI and Machine Learning: From Neural Networks to Applications
Overview
Google, IBM & Meta Certificates – 40% Off
One plan covers every Professional Certificate on Coursera.
Unlock All Certificates
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