The parametrized complexity of knot polynomials (Q1877705): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4699283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3787506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fusion in relational structures and the verification of monadic second-order properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial invariant of knots and links / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of knot and link problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tutte polynomial for signed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Invariant of Regular Isotopy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3989600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Farrell polynomials on graphs of bounded tree width / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTING THE JONES POLYNOMIAL ON BIPARTITE GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating the 2-variable polynomial for knots presented as closed braids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical roots of knot theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariants of links of Conway type / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fourth Skein Module and the Montesinos-Nakanishi Conjecture for 3-algebraic links / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4951107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation of links by braids: A new algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140234 / rank
 
Normal rank

Latest revision as of 19:09, 6 June 2024

scientific article
Language Label Description Also known as
English
The parametrized complexity of knot polynomials
scientific article

    Statements

    The parametrized complexity of knot polynomials (English)
    0 references
    0 references
    0 references
    19 August 2004
    0 references
    Jones polynomials
    0 references
    Kauffman polynomials
    0 references
    HOMFLY polynomials
    0 references
    Tutte polynomials
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references