Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations (Q299048): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1261470
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2014.10.003 / rank
Normal rank
 
Property / author
 
Property / author: Marcos A. Kiwi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2014.10.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091727548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of generalized satisfiability counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Classifications of Boolean Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponentially many perfect matchings in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics, three-dimensionality and NP-completeness / 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: Satisfying states of triangulations of a convex \(n\)-gon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5188078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a theory of frustrated degeneracy. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The critical exponents of the two-dimensional Ising spin glass revisited: exact ground-state calculations and Monte Carlo simulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5470460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972641 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2014.10.003 / rank
 
Normal rank

Latest revision as of 13:45, 9 December 2024

scientific article
Language Label Description Also known as
English
Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations
scientific article

    Statements

    Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations (English)
    0 references
    0 references
    0 references
    22 June 2016
    0 references
    Ising model
    0 references
    triangulations
    0 references
    groundstates
    0 references
    parsimonious reduction
    0 references
    \(\# \operatorname{P}\)-completeness
    0 references

    Identifiers