On the computational complexity of the order polynomial (Q1086595)

From MaRDI portal
Revision as of 17:11, 17 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the computational complexity of the order polynomial
scientific article

    Statements

    On the computational complexity of the order polynomial (English)
    0 references
    0 references
    0 references
    1986
    0 references
    Efficient algorithms for computing the order polynomial for the classes of orders with bounded width and series-parallel orders are presented. It is proved that for any fixed i the i-th coefficient of the order polynomial can be computed in polynomial time for the class of semiorders.
    0 references
    0 references
    computational complexity
    0 references
    order polynomial
    0 references
    orders with bounded width
    0 references
    series-parallel orders
    0 references
    polynomial time
    0 references
    semiorders
    0 references

    Identifiers