Pages that link to "Item:Q1877705"
From MaRDI portal
The following pages link to The parametrized complexity of knot polynomials (Q1877705):
Displaying 8 items.
- Courcelle's theorem for triangulations (Q346450) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Computing HOMFLY polynomials of 2-bridge links from 4-plat representation (Q741749) (← links)
- On the calculation of the Kauffman bracket polynomial (Q963954) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- Farrell polynomials on graphs of bounded tree width (Q1398293) (← links)
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width (Q1764811) (← links)
- The HOMFLY-PT polynomial is fixed-parameter tractable (Q5115785) (← links)
