On the algebraic complexity of some families of coloured Tutte polynomials (Q1433009): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q452475
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Johann A. Makowsky / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the Tutte polynomials of graphs of bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexities of the coefficients of the Tutte polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tutte Polynomial for Coloured Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness and reduction in algebraic complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cook's versus Valiant's hypothesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gap-definable counting classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4359457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries / 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: A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5605168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting problems over the reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weighted graph polynomial from chromatic invariants of knots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tutte polynomials computable in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complexity theory based on Boolean algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A symmetric function generalization of the chromatic polynomial of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4047029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dichromatic Polynomial for Weighted Graphs and Link Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4842541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3929052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomised Approximation in the Tutte Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4704790 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0196-8858(03)00087-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037760470 / rank
 
Normal rank

Latest revision as of 09:24, 30 July 2024

scientific article
Language Label Description Also known as
English
On the algebraic complexity of some families of coloured Tutte polynomials
scientific article

    Statements

    On the algebraic complexity of some families of coloured Tutte polynomials (English)
    0 references
    0 references
    0 references
    15 June 2004
    0 references
    partition function
    0 references
    Ising model
    0 references
    coloured Tutte polynomial
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers