BIROn - Birkbeck Institutional Research Online

    The complexity of the Greedoid Tutte Polynomial

    Knapp, C. and Noble, Steven (2022) The complexity of the Greedoid Tutte Polynomial. Technical Report. Birkbeck, University of London, London, UK. (Submitted)

    [img]
    Preview
    Text
    difficultpointsbbk.pdf - Published Version of Record
    Available under License Creative Commons Attribution.

    Download (413kB) | Preview

    Abstract

    We consider the Tutte polynomial of three classes of greedoids: those arising from rooted graphs, rooted digraphs and binary matrices. We establish the computational complexity of evaluating each of these polynomials at each fixed rational point (x,y). In each case we show that evaluation is #P-hard except for a small number of exceptional cases when there is a polynomial time algorithm.

    Metadata

    Item Type: Monograph (Technical Report)
    Additional Information: Birkbeck Pure Mathematics Preprint Series
    School: Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
    Depositing User: Steven Noble
    Date Deposited: 26 Apr 2023 12:57
    Last Modified: 09 Aug 2023 12:54
    URI: https://eprints.bbk.ac.uk/id/eprint/50182

    Statistics

    Activity Overview
    6 month trend
    22Downloads
    6 month trend
    58Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item