Approximating the partition function of planar two-state spin systems (Q743131): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Percolation and the hard-core lattice gas model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary-to-Boundary Flows in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spin Systems on Graphs with Complex Edge Functions and Specified Degree Regularities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The problem of uniqueness of a Gibbsian random field and the problem of phase transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation inequalities on some partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved inapproximability results for counting independent sets in the hard-core model / 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: Some simplified NP-complete graph problems / 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: The computational complexity of two‐state spin systems / 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: Random generation of combinatorial structures from a uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some observations on the probabilistic algorithms and NP-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation Decay up to Uniqueness in Spin Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slow mixing of glauber dynamics via topological obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved mixing condition on the grid for counting and sampling independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting independent sets up to the tree threshold / rank
 
Normal rank

Latest revision as of 01:24, 9 July 2024

scientific article
Language Label Description Also known as
English
Approximating the partition function of planar two-state spin systems
scientific article

    Statements

    Approximating the partition function of planar two-state spin systems (English)
    0 references
    0 references
    0 references
    0 references
    22 September 2014
    0 references
    counting complexity
    0 references
    independent sets
    0 references
    hard-core model
    0 references
    planar graphs
    0 references
    phase transition
    0 references

    Identifiers

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