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

From MaRDI portal
Revision as of 02:14, 22 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q43205764, #quickstatements; #temporary_batch_1708557319324)
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
    0 references
    0 references
    0 references
    0 references
    term rewriting
    0 references
    complexity analysis
    0 references
    implicit computational complexity
    0 references
    automation
    0 references
    0 references