Approximate Counting and Sampling

Approximate Counting and Sampling

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


Duration: 58:05
1,062 views
19

Kuldeep Meel (National University of Singapore)
https://simons.berkeley.edu/talks/pseudo-boolean-solving-and-optimization
Satisfiability: Theory, Practice, and Beyond Boot Camp



Other Videos By Simons Institute for the Theory of Computing


2021-02-18On the Usefulness of the Strong Exponential Time Hypothesis
2021-02-18Total Function Problems in the Polynomial Hierarchy
2021-02-17Combining SAT and Computer Algebra for Circuit Verification
2021-02-11Hypotheses about Satisfiability and their Consequences
2021-02-11Existentially Polytime Theorems
2021-02-09The Rise of Approximate Model Counting: Beyond Classical Theory and Practice of SAT
2021-02-09Quantum Supremacy via Boson Sampling: Theory and Practice | Quantum Colloquium
2021-02-08Reactive Synthesis
2021-02-06Using SAT Solvers to Prevent Causal Failures in the Cloud
2021-02-05Programming Z3
2021-02-05Approximate Counting and Sampling
2021-02-04Pseudo-Boolean Solving and Optimization
2021-02-03Proof Complexity
2021-02-03Pseudo-Boolean Solving and Optimization 4
2021-02-03Pseudo-Boolean Solving and Optimization 2
2021-02-03Pseudo-Boolean Solving and Optimization 3
2021-02-03Pseudo-Boolean Solving and Optimization 1
2021-02-02SAT-Solving
2021-02-01SAT-Centered Complexity Theory
2021-01-31Proof Complexity C
2021-01-29Specification, Verification and Synthesis in Cyberphysical Systems


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Kuldeep Meel
Satisfiability Theory Practice and Beyond Boot Camp