Approximate Counting II

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


Duration: 55:50
227 views
0

Davin Richerby, University of Oxford
Counting Complexity and Phase Transitions Boot Camp
https://simons.berkeley.edu/talks/david-richerby-2016-01-26



Other Videos By Simons Institute for the Theory of Computing


2016-02-05Modeling Mutational Patterns in Tumor Genomic Data
2016-02-05Survival Time Prediction from Mutation Profiles Using Gene Networks
2016-02-05Optimizing Combination Cancer Therapy Based on Single Cell Analysis
2016-02-05Mutual Exclusivity of Mutations Across Different Cancer Types - A Molecular Network Perspective
2016-02-05Rank-Based Representations to Learn from Omics Data
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-01Random Constraint Satisfaction Problems
2016-02-01Dichotomy Theorems for Counting Problems II
2016-02-01Constraints, Gadgets, and Invariants
2016-02-01The Classification Program 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


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