The Complexity of Computing Quantities

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


Duration: 48:41
590 views
3

Leslie Valiant, Harvard University
Simons Institute Open Lecture
https://simons.berkeley.edu/events/openlectures2016-spring-3



Other Videos By Simons Institute for the Theory of Computing


2016-04-04Dichotomies for Counting Subgraphs
2016-04-04Counting Approximation Complexity Classification Through Clones and Invariants
2016-04-04Dichotomy Theorems for Generalized Chromatic Polynomials
2016-04-04Canonical Paths for MCMC: From Art to Science
2016-04-04Enumerator Polynomials: Completeness and Intermediate Complexity
2016-04-04Hilbert's Nullstellensatz Certificates of Infeasibility for Combinatorial Problems
2016-04-04Finding a Large Submatrix of a Random Matrix, and the Overlap Gap Property
2016-04-04LP Relaxations for Valued CSPs
2016-04-04Categories, Representations, and Counting Complexity
2016-04-04Counting with Bounded Treewidth
2016-03-29The Complexity of Computing Quantities
2016-03-22Decoding the Human Microbiome
2016-03-21Threshold Phenomena in Combinatorics
2016-03-11Discovery of Transcription Factor Binding Motifs from Large Sequence Sets
2016-03-11Algorithms for Single Cell RNAseq Analysis
2016-03-11Spectral Algorithms for Learning HMMs and Tree HMMs for Epigenetics Data
2016-03-11Accurate, Fast, and Model-Aware Transcript Expression Quantification with Salmon
2016-03-11Reconstructing Dynamic Signaling and Regulatory Networks
2016-03-11Co-occupancy Networks for Histone Modifications and Chromatin Associated Proteins
2016-03-11Beyond Enhancer Modularity: Locus-level Control of Gene Expression in Development
2016-03-11Scoring Transcript Variation in Single Cell RNA-seq Data


Tags:
simons institute
UC Berkeley
Leslie Valient
Computer Science
Complexity
Theory of computing
Open Lecture