Dichotomy Theorems for Counting Problems II

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=bkzVQBF7CqA


Duration: 57:32
279 views
0

Xi Chen, Columbia University
Counting Complexity and Phase Transitions Boot Camp
https://simons.berkeley.edu/talks/xi-chen-2016-01-27



Other Videos By Simons Institute for the Theory of Computing


2016-02-01The Simple, Little and Slow Things Count: On Parameterized Counting Complexity
2016-02-01Markov Chain Mixing Times and Applications III
2016-02-01The Classification Program for Counting Problems I
2016-02-01Where the Hard Things Are
2016-02-01Approximate Counting I
2016-02-01Approximate Counting II
2016-02-01Dichotomy Theorems for Counting Problems I
2016-02-01The Partition Function, Sampling and Equilibration in Physics
2016-02-01Markov Chain Mixing Times and Applications I
2016-02-01Markov Chain Mixing Times and Applications II
2016-02-01Dichotomy Theorems for Counting Problems II
2016-02-01The Classification Program for Counting Problems III
2016-02-01Decay of Correlations in Spin Systems
2016-01-25Fundamentals of Stringology II: Probability and Statistics for Sequence Alignment
2016-01-25Fundamentals of Stringology I: Recap on Exact Pattern Matching and Alignment Algorithms
2016-01-25Fundamentals of Stringology III: Suffix Tress and Suffix Arrays
2016-01-25Fundamentals of Stringology IV: The Burrows-Wheeler Transform
2016-01-25Fundamental Algorithms in Deep Sequencing I: Assembly
2016-01-25Introduction to Cancer Bioinformatics I: Inferring Genomic Variation from Tumor Sequencing Data
2016-01-25Fundamental Algorithms in Deep Sequencing II: Mapping/Alignment
2016-01-25Fundamental Algorithms in Deep Sequencing III: Genomic Compression: Storage, Transmission, and ...


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Counting Complexity and Phase Transitions
Xi Chen