A new order-theoretic characterisation of the polytime computable functions (Q2346988)

From MaRDI portal
Revision as of 10:02, 3 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A new order-theoretic characterisation of the polytime computable functions
scientific article

    Statements

    A new order-theoretic characterisation of the polytime computable functions (English)
    0 references
    0 references
    0 references
    0 references
    26 May 2015
    0 references
    term rewriting
    0 references
    complexity analysis
    0 references
    implicit computational complexity
    0 references
    automation
    0 references

    Identifiers