Counting Solutions to Random CNF Formulas

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


Duration: 40:32
675 views
10

Leslie Ann Goldberg, University of Oxford
Computational Phase Transitions
https://simons.berkeley.edu/talks/counting-solutions-random-cnf-formulas



Other Videos By Simons Institute for the Theory of Computing


2020-09-24Sampling From the Random Cluster Model at All Temperatures on Random Graphs
2020-09-24Correlation Decay for Hard Spheres via Markov Chains
2020-09-23Nodal Domains of G(n,p) Graphs
2020-09-23Pedagogical Talk: Random Optimisation Problems
2020-09-23Information/Computation Gaps in Heavy-Tailed Statistics
2020-09-23The Sum-of-Squares Approach to Clustering Non-Spherical Gaussian Mixtures
2020-09-23Thresholds of Descending Algorithms in Inference Problems
2020-09-23Optimization of Full-RSB Spherical Spin Glasses
2020-09-22A Positivity-First Approach to Sum-of-Squares Over the Hypercube
2020-09-22Equitable Colorings
2020-09-21Counting Solutions to Random CNF Formulas
2020-09-21Incremental Approximate Message Passing
2020-09-21Local Statistics, Semidefinite Programming, and Community Detection II
2020-09-21Local Statistics, Semidefinite Programming, and Community Detection
2020-09-21Testing Correlation of Unlabeled Random Graphs
2020-09-17The Alignment Problem: Machine Learning and Human Values
2020-09-14Insights on Gradient-Based Algorithms in High-Dimensional Learning
2020-09-10Hard Choices in Artificial Intelligence
2020-09-08Polynomial Time Trace Reconstruction in the Smoothed Complexity Model
2020-09-08The Interpolation Phase Transition in Neural Networks: Memorization and Generalization Lazy Training
2020-09-05Simulation Methodology: An Overview (Part 2)


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Leslie Ann Goldberg
Computational Phase Transitions