On the computational complexity of the Jones and Tutte polynomials (Q4712248): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q55879602, #quickstatements; #temporary_batch_1706300061798 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:21, 29 January 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
