scientific article; zbMATH DE number 7559408
From MaRDI portal
Publication:5089204
DOI10.4230/LIPIcs.MFCS.2020.37zbMath1495.68171MaRDI QIDQ5089204
No author found.
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Expander graphs (05C48)
Related Items (2)
Approximately counting independent sets in bipartite graphs via graph containers ⋮ Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs
Cites Work
- Unnamed Item
- Unnamed Item
- \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
- Counting in two-spin models on \(d\)-regular graphs
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
- Explicit construction of linear sized tolerant networks
- The relative complexity of approximate counting problems
- Interlacing eigenvalues and graphs
- Large incidence-free sets in geometries
- The complexity of partition functions
- Approximately Counting $H$-Colorings is $\#\mathrm{BIS}$-Hard
- Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region
- Explicit Concentrators from Generalized N-Gons
- Expander graphs and their applications
- Approximating the Partition Function of the Ferromagnetic Potts Model
- Eigenvalues and expansion of regular graphs
- The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random
- Counting independent sets in unbalanced bipartite graphs
- Algorithmic Pirogov-Sinai theory
- Algorithms for #BIS-hard problems on expander graphs
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
- Counting Independent Sets and Colorings on Random Regular Bipartite Graphs
This page was built for publication:
