On the computational complexity of the Jones and Tutte polynomials (Q4712248): Difference between revisions
From MaRDI portal
Latest revision as of 08:36, 15 May 2024
scientific article; zbMATH DE number 6335
Language | Label | Description | Also known as |
---|---|---|---|
English | On the computational complexity of the Jones and Tutte polynomials |
scientific article; zbMATH DE number 6335 |
Statements
On the computational complexity of the Jones and Tutte polynomials (English)
0 references
25 June 1992
0 references
computing the Jones polynomial of a link
0 references
Alexander-Conway polynomial
0 references
\(\#P\)-hard
0 references
Tutte polynomial of a matroid
0 references
0 references