Approximate Counting I

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


Duration: 1:01:42
1,418 views
4

Leslie Ann Goldberg, University of Oxford
Counting Complexity and Phase Transitions Boot Camp
https://simons.berkeley.edu/talks/leslie-ann-goldberg-2016-01-25



Other Videos By Simons Institute for the Theory of Computing


2016-02-05Complexity Issues in Rearrangement Evolution
2016-02-05BitPhylogeny: A Probabilistic Framework for Reconstructing Intra-tumor Phylogenies
2016-02-05Expression Analysis of Tumors Based on Patterns in Alternative Splicing
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-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-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


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Counting Complexity and Phase Transitions
Leslie Ann Goldberg