The computational complexity of knot and matroid polynomials (Q1313843)

From MaRDI portal





scientific article; zbMATH DE number 500623
Language Label Description Also known as
English
The computational complexity of knot and matroid polynomials
scientific article; zbMATH DE number 500623

    Statements

    The computational complexity of knot and matroid polynomials (English)
    0 references
    20 July 1995
    0 references
    Tutte polynomial
    0 references
    \(\#\)P-hard
    0 references
    Ising partition function
    0 references
    knot polynomials
    0 references
    matroids
    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
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references