Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs (Q5886117): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Mark R. Jerrum / rank
Normal rank
 
Property / author
 
Property / author: Mark R. Jerrum / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3155378399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial characterization of some graph partitioning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some applications of Wagner's weighted subgraph counting polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Dichotomies for Counting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Mechanics of Lattice Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random sampling of 3‐colorings in ℤ<sup>2</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum cut on line and total graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical Paths for MCMC: from Art to Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4798347 / 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: Ground states, residual entropies, and specific heat capacity properties of frustrated Ising system on pyrochlore lattice in effective field theory cluster approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holant problems for 3-regular graphs with complex edge functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast convergence of the Glauber dynamics for sampling independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistics of Kagomé Lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive simulated annealing: A near-optimal connection between sampling and counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical Models, Exponential Families, and Variational Inference / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:44, 31 July 2024

scientific article; zbMATH DE number 7670433
Language Label Description Also known as
English
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs
scientific article; zbMATH DE number 7670433

    Statements

    Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 March 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references