COMPUTING THE JONES POLYNOMIAL ON BIPARTITE GRAPHS (Q4541038): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / 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: Tutte polynomials computable in polynomial time / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0218216501001104 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1980126517 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:10, 30 July 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
