COMPUTING THE JONES POLYNOMIAL ON BIPARTITE GRAPHS (Q4541038): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 12: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
    0 references
    30 July 2002
    0 references
    0 references
    knot invariant
    0 references