Approximating #BIS in (O(n 1/3)) Time
cs.DS
Submitted: 2026-11-04
Updated: 2026-11-04
Code: https://github.com/anthropics/formal-math
Project page: https://kuikuiliu.github.io/files/au2023/6S891-lec11.pdf
Terminology
Sources
- Learning with Submodular Functions: A Convex Optimization Perspective
- Random Weighting, Asymptotic Counting, and Inverse Isoperimetry
- Rapid Mixing at the Uniqueness Threshold
- The Complexity of Approximately Counting Stable Matchings
- Pirogov--Sinai Theory Beyond Lattices
- Uniqueness and Rapid Mixing in the Bipartite Hardcore Model
- Polymer Dynamics via Cliques: New Conditions for Approximations
- On the Partition Function and Random Maximum A-Posteriori Perturbations
- On Sampling from the Gibbs Distribution with Random Maximum A-Posteriori Perturbations
- Sampling from the Hardcore Model on Random Regular Bipartite Graphs above the Uniqueness Threshold
- Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs
- Analysis of Boolean Functions
- Parameter Learning for Log-supermodular Distributions
- The multivariate Tutte polynomial (alias Potts model) for graphs and matroids
- Solving Statistical Mechanics Using Variational Autoregressive Networks
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time