Spin systems on \(k\)-regular graphs with complex edge functions (Q690458): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.tcs.2012.01.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003244973 / 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: A computational proof of complexity of some restricted counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holant Problems for Regular Graphs with Complex Edge Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3324796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5485625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beitrag zur Theorie des Ferromagnetismus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Spontaneous Magnetization of a Two-Dimensional Ising Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Theory of Equations of State and Phase Transitions. I. Theory of Condensation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimer problem in statistical mechanics-an exact result / rank
 
Normal rank
Property / cites work
 
Property / cites work: The statistics of dimers on a lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5605168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy theorem for constraint satisfaction problems on a 3-element set / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Counting Constraint Satisfaction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a dichotomy theorem for the counting constraint satisfaction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of partition functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Homomorphisms with Complex Values: A Dichotomy Theorem / 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: On the complexity of #CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Weighted Boolean #CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On counting homomorphisms to directed acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4521549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complexity Dichotomy for Partition Functions with Mixed Signs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4317713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Circuits That Can Be Simulated Classically in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holant problems and counting CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic algorithms: from art to science / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting in Sparse, Regular, and Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of counting problems on 3-regular planar graphs / rank
 
Normal rank

Latest revision as of 21:53, 5 July 2024

scientific article
Language Label Description Also known as
English
Spin systems on \(k\)-regular graphs with complex edge functions
scientific article

    Statements

    Spin systems on \(k\)-regular graphs with complex edge functions (English)
    0 references
    0 references
    0 references
    27 November 2012
    0 references
    Holant problem
    0 references
    partition function
    0 references
    dichotomy theorem
    0 references
    holographic algorithms
    0 references
    interpolation
    0 references
    counting complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers