On the computational complexity of the Jones and Tutte polynomials (Q4712248): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Dominic J. A. Welsh / rank
Normal rank
 
Property / author
 
Property / author: Dominic J. A. Welsh / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q55879602 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Kauffman polynomial of an adequate link / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spanning tree expansion of the Jones polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tutte polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3748279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere-zero 6-flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of regular matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition for Combinatorial Geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Principal Edge Tripartition of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Isomorphisms and Density of $NP$ and Other Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3324796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Reliability Computations in Planar and Acyclic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarkable valuation of the dichromatic polynomial of planar multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Enumeration Problems in Geometry and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomials for Links / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity in oriented matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5605168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial invariant for knots via von Neumann algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facing up to arrangements: face-count formulas for partitions of space by hyperplanes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Abstract Properties of Linear Dependence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical expansion in mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tutte Polynomials and Bicycle Dimension of Ternary Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tutte Polynomials and Link Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Tutte polynomials and cycles of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:36, 15 May 2024

scientific article; zbMATH DE number 6335
Language Label Description Also known as
English
On the computational complexity of the Jones and Tutte polynomials
scientific article; zbMATH DE number 6335

    Statements

    On the computational complexity of the Jones and Tutte polynomials (English)
    0 references
    0 references
    0 references
    0 references
    25 June 1992
    0 references
    computing the Jones polynomial of a link
    0 references
    Alexander-Conway polynomial
    0 references
    \(\#P\)-hard
    0 references
    Tutte polynomial of a matroid
    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