The complexity of approximating the complex-valued Potts model (Q5089203): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
The complexity of approximating the complex-valued Potts model
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted counting of solutions to sparse systems of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: STATISTICAL MECHANICS OF EQUILIBRIUM AND NONEQUILIBRIUM PHASE TRANSITIONS: THE YANG–LEE FORMALISM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of the independent set polynomial in the complex plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Counting and Quantum Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Dynamical Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic roots of generalized theta graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of approximating complex-valued Ising and Tutte partition functions / 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 Partition Function of the Ferromagnetic Potts Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of the Tutte polynomial of a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Computing the Sign of the Tutte Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zeros of Holant problems: locations and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zeros of ferromagnetic 2-spin systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of monomer-dimer systems / 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: Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2941639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fisher zeros and correlation decay in the Ising model / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ising partition function: zeros and deterministic approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Sokal concerning roots of the independence polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5815557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spanning tree expansion of the Jones polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Tutte Invariants for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140234 / 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4230/LIPIcs.MFCS.2020.36 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3082899220 / rank
 
Normal rank
Property / title
 
The complexity of approximating the complex-valued Potts model (English)
Property / title: The complexity of approximating the complex-valued Potts model (English) / rank
 
Normal rank

Latest revision as of 10:57, 30 July 2024

scientific article; zbMATH DE number 7559407
Language Label Description Also known as
English
The complexity of approximating the complex-valued Potts model
scientific article; zbMATH DE number 7559407

    Statements

    0 references
    0 references
    18 July 2022
    0 references
    approximate counting
    0 references
    Potts model
    0 references
    Tutte polynomial
    0 references
    partition function
    0 references
    complex numbers
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    The complexity of approximating the complex-valued Potts model (English)
    0 references

    Identifiers