COMPUTING THE JONES POLYNOMIAL ON BIPARTITE GRAPHS (Q4541038): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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: Tutte polynomials computable in polynomial time / rank | |||
Normal rank | |||
Revision as of 11:14, 4 June 2024
scientific article; zbMATH DE number 1773584
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | COMPUTING THE JONES POLYNOMIAL ON BIPARTITE GRAPHS |
scientific article; zbMATH DE number 1773584 |
Statements
COMPUTING THE JONES POLYNOMIAL ON BIPARTITE GRAPHS (English)
0 references
30 July 2002
0 references
knot invariant
0 references
