A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid (Q5891167): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
description / endescription / en
 
scientific article; zbMATH DE number 5917989
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1333.68122 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-22006-7_44 / rank
 
Normal rank
Property / published in
 
Property / published in: Automata, Languages and Programming / rank
 
Normal rank
Property / publication date
 
6 July 2011
Timestamp+2011-07-06T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 6 July 2011 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5917989 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1769441766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting formulas for Tutte polynomials / 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: Inapproximability of the Tutte polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of the Jones and Tutte polynomials / 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: Q3135082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5815557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of regular matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theory for matroids. V: Testing of matrix total unimodularity / rank
 
Normal rank

Latest revision as of 06:51, 4 July 2024

scientific article; zbMATH DE number 5917989
Language Label Description Also known as
English
A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid
scientific article; zbMATH DE number 5917989

    Statements

    A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 September 2013
    0 references
    6 July 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    Ising model
    0 references
    matroids
    0 references
    Tutte polynomial
    0 references
    0 references
    0 references
    0 references