An FPTAS for the hardcore model on random regular bipartite graphs (Q2166750): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Counting independent sets up to the tree threshold / 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: FPTAS for #BIS with Degree Bounds on One Side / 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: The relative complexity of approximate counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation trichotomy for Boolean \#CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressibility of functions on the boolean domain, with applications to counting CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111357 / 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: A complexity classification of spin systems with an external field / 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: Algorithmic Pirogov-Sinai theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster expansion for abstract polymer models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics and complexity of partition functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the partition function for graph homomorphisms with multiplicities / 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: Algorithms for #BIS-hard problems on expander graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms at low temperatures via Markov chains† / 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: A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomly coloring constant degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved FPTAS for Multi-spin Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for Randomly Sampling Colorings via Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for sampling colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for Counting Proper Four-Colorings on Cubic Graphs / 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: Algorithms for #BIS-Hard Problems on Expander Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically optimal switching circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Left and right convergence of graphs with bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2833177 / rank
 
Normal rank

Revision as of 22:38, 29 July 2024

scientific article
Language Label Description Also known as
English
An FPTAS for the hardcore model on random regular bipartite graphs
scientific article

    Statements

    An FPTAS for the hardcore model on random regular bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 August 2022
    0 references
    hardcore model
    0 references
    coloring
    0 references
    FPTAS
    0 references
    polymer model
    0 references
    0 references
    0 references
    0 references

    Identifiers