Algorithms for #BIS-Hard Problems on Expander Graphs (Q3304735): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Eigenvalues and expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the permanent of (some) complex matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics and complexity of partition functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted counting of solutions to sparse systems of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically optimal switching circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting independent sets in unbalanced bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of approximately counting stable matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5875497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The replica symmetric solution for Potts models on \(d\)-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative complexity of approximate counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of alon's second eigenvalue conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Phase Transition in the Hard-Core Model on ${\mathbb Z}^d$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Partition Function of the Ferromagnetic Potts Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random cluster dynamics for the Ising model is rapidly mixing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Pirogov-Sinai theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander graphs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for #BIS-hard problems on expander graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Approximation Algorithms for the Ising Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3721805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster expansion for abstract polymer models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Independent Sets and Colorings on Random Regular Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPTAS for #BIS with Degree Bounds on One Side / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Play Unique Games on Expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of sampling independent sets beyond the tree threshold / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the number of induced copies of a fixed graph in a bounded degree graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting in two-spin models on \(d\)-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Concentrators from Generalized <i>N</i>-Gons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting independent sets up to the tree threshold / rank
 
Normal rank

Latest revision as of 04:40, 23 July 2024

scientific article
Language Label Description Also known as
English
Algorithms for #BIS-Hard Problems on Expander Graphs
scientific article

    Statements

    Algorithms for #BIS-Hard Problems on Expander Graphs (English)
    0 references
    0 references
    0 references
    0 references
    3 August 2020
    0 references
    approximate counting
    0 references
    expander graphs
    0 references
    hard-core model
    0 references
    cluster expansion
    0 references
    sampling
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references