A Deterministic Algorithm for Counting Colorings with 2Δ Colors
Offered By: IEEE via YouTube
Course Description
Overview
Explore a deterministic algorithm for counting colorings with 2Δ colors in this 22-minute IEEE conference talk. Delve into the intricacies of Q-Coloring, randomized algorithms, and phase transitions. Examine concepts such as partition functions, dominos interpolation, and zero-free regions. Gain insights into triangle-free regions, entropy conditions, and the main ideas behind this innovative approach. Learn from speakers Jingcheng Liu, Alistair Sinclair, and Piyush Srivastava as they present their findings and recap the key points of this advanced mathematical topic.
Syllabus
Introduction
QColoring
Results
Randomized Algorithm
What is Phase Transition
Partition Function
Dominos Interpolation
Zero Free Region
Triangle Free Region
Different Algorithm
Main Idea
Entropy Condition
Recap
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against NatureIEEE via YouTube Computation in the Brain Tutorial - Part 2
IEEE via YouTube Computation in the Brain - Part 1
IEEE via YouTube Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
IEEE via YouTube Cookbook Lower Bounds for Statistical Inference in Distributed and Constrained Settings - Part 1
IEEE via YouTube