On the algebraic complexity of some families of coloured Tutte polynomials
From MaRDI portal
(Redirected from Publication:1433009)
Recommendations
- A Tutte Polynomial for Coloured Graphs
- The complexities of the coefficients of the Tutte polynomial
- Multivariable, parameterized, and colored extensions of the Tutte polynomial
- On the computational complexity of the Jones and Tutte polynomials
- On the complexity of generalized chromatic polynomials
- The exact complexity of the Tutte polynomial
- Some algebraic structures related to the Tutte polynomial
- On the Tutte polynomial
- On the colored Tutte polynomial of a graph of bounded treewidth
- \(T\)-chromatic polynomials
Cites work
- scientific article; zbMATH DE number 1670492 (Why is no real title available?)
- scientific article; zbMATH DE number 437298 (Why is no real title available?)
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 3744549 (Why is no real title available?)
- scientific article; zbMATH DE number 3461412 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 1057883 (Why is no real title available?)
- scientific article; zbMATH DE number 1072530 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 1369835 (Why is no real title available?)
- scientific article; zbMATH DE number 785052 (Why is no real title available?)
- scientific article; zbMATH DE number 795115 (Why is no real title available?)
- scientific article; zbMATH DE number 3326387 (Why is no real title available?)
- A Dichromatic Polynomial for Weighted Graphs and Link Polynomials
- A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
- A Tutte Polynomial for Coloured Graphs
- A complexity theory based on Boolean algebra
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- A symmetric function generalization of the chromatic polynomial of a graph
- A weighted graph polynomial from chromatic invariants of knots
- An algorithm for the Tutte polynomials of graphs of bounded treewidth
- Approximation algorithms for NP-hard problems.
- Colored Tutte polynomials and Kauffman brackets for graphs of bounded tree width
- Completeness and reduction in algebraic complexity theory
- Cook's versus Valiant's hypothesis
- Counting problems over the reals
- Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
- Gap-definable counting classes
- Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
- On the computational complexity of the Jones and Tutte polynomials
- Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
- Randomised Approximation in the Tutte Plane
- The complexities of the coefficients of the Tutte polynomial
- The complexity of computing the permanent
- Tutte polynomials computable in polynomial time
Cited in
(10)- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
- Complexity of the Bollobás-Riordan Polynomial
- A Dichotomy Theorem for Polynomial Evaluation
- Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions
- Algorithmic uses of the Feferman-Vaught theorem
- How I got to like graph polynomials
- Complexity and approximability of the cover polynomial
- Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants
- A Subset Expansion of the Coloured Tutte Polynomial
- From a zoo to a zoology: Towards a general theory of graph polynomials
This page was built for publication: On the algebraic complexity of some families of coloured Tutte polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1433009)
