Inapproximability of the Independent Set Polynomial in the Complex Plane

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


Duration: 53:52
320 views
4

Ivona Bezáková (Rochester Institute of Technology)
https://simons.berkeley.edu/talks/talk-36
Deterministic Counting, Probability, and Zeros of Partition Functions



Other Videos By Simons Institute for the Theory of Computing


2019-03-20Approximating the Matching Polynomial
2019-03-20Zeros of Moment Generating Functions and the Riemann Hypothesis
2019-03-19Counting Matchings via the Capacity Method
2019-03-19Approximating the Permanent of a Random Matrix with Vanishing Mean
2019-03-19Entropy, Capacity, and Counting
2019-03-19Counting Degree-constrained Subgraphs and Orientations
2019-03-19Zeros for Partition Functions and Graph-counting Polynomials.
2019-03-19Reflection Positivity as Complement to the Location of Zeros of Partition Functions
2019-03-18The Six- and the Eight-vertex Models and Counting Perfect Matchings
2019-03-18Deterministic Approximation of the Ising Partition Function
2019-03-18Inapproximability of the Independent Set Polynomial in the Complex Plane
2019-03-18Computation of the Multivariate Independence Polynomial by Correlation Decay
2019-03-15Mechanism Design: Sample Complexity and Loss Functions
2019-03-15(Part 2) Operationally Motivating IT Leakage Measures – A Path to Maximal Leakage (Part 2)
2019-03-15Information Bottleneck and Privacy Funnel: IT Lens on Privacy-Utility Tradeoff (PUT) Problems
2019-03-14Generative Adversarial Models for Privacy and Fairness
2019-03-14Fairness: IT Approaches
2019-03-14Unifying IT Leakage Measures via the Lens of Adversarial Learning
2019-03-14(Part 1) Operationally Motivating IT Leakage Measures – A Path to Maximal Leakage
2019-03-11The Predictive Brain: Michael Pollan, Celeste Kidd, Christos Papadimitriou, and Bruno Olshausen
2019-03-08Open DP: A Proposal for an Open-Source Suite of Differential Privacy Tools


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Ivona Bezáková
Deterministic Counting Probability and Zeros of Partition Functions