Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions (Q987376): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: tutte_bhkk / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-009-9213-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020085754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Most General Edge Elimination Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Travelling Salesman Problem in Bounded Degree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the Cover Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPLEXITY AND REAL COMPUTATION: A MANIFESTO / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tutte Polynomial for Coloured Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Time Complexity of the Permanent and the Tutte Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Most General Edge Elimination Polynomial – Thickening of Edges / 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: A Tutte polynomial for signed graphs / 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: On the algebraic complexity of some families of coloured Tutte polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic uses of the Feferman-Vaught theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: From a zoo to a zoology: Towards a general theory of graph polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic orientations of graphs. (Reprint) / rank
 
Normal rank
Property / cites work
 
Property / cites work: PP is as Hard as the Polynomial-Time Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:40, 3 July 2024

scientific article
Language Label Description Also known as
English
Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions
scientific article

    Statements

    Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions (English)
    0 references
    0 references
    0 references
    0 references
    13 August 2010
    0 references
    0 references
    computational complexity
    0 references
    Tutte polynomial
    0 references
    graph polynomials
    0 references
    algebraic reductions
    0 references
    0 references