Approximating the chromatic polynomial is as hard as computing it exactly (Q6121107): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4390986120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics and complexity of partition functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the location of chromatic zeros of series-parallel graphs / 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: Chromatic Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cayley trees do not determine the maximal zero-free locus of the independence polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting measure of Lee-Yang zeros for the Cayley tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regions Without Complex Zeros for Chromatic Polynomials on Graphs with Bounded Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of approximating the complex-valued Potts model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region / 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: 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: Complex zero-free regions at large \(|q|\) for multivariate Tutte polynomials (alias Potts-model partition functions) with general complex edge weights / 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 Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers / 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: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inequality for the discriminant of a polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Inequality About Factors of Polynomials / 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: Density of Chromatic Roots in Minor-Closed Graph Families / 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: Location of zeros for the partition function of the Ising model on bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic Roots are Dense in the Whole Complex Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing in the field of complex algebraic numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Zero-Free Intervals for Chromatic Polynomials of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE GOLDEN RATIO IN THE THEORY OF CHROMATIC POLYNOMIALS. / 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: A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The largest real zero of the chromatic polynomial / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:27, 27 August 2024

scientific article; zbMATH DE number 7809280
Language Label Description Also known as
English
Approximating the chromatic polynomial is as hard as computing it exactly
scientific article; zbMATH DE number 7809280

    Statements

    Approximating the chromatic polynomial is as hard as computing it exactly (English)
    0 references
    0 references
    0 references
    0 references
    26 February 2024
    0 references
    \#P-hardness
    0 references
    approximate counting
    0 references
    chromatic polynomial
    0 references
    planar graphs
    0 references
    Tutte polynomial
    0 references
    0 references
    0 references

    Identifiers