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
Science & Cooking: From Haute Cuisine to Soft Matter Science (chemistry)Harvard University via edX Chemistry: Concept Development and Application Part II
Rice University via Coursera Statistical Mechanics: Algorithms and Computations
École normale supérieure via Coursera General Chemistry: Concept Development and Application
Rice University via Coursera Thermodynamique : fondements
École Polytechnique Fédérale de Lausanne via Coursera