Characterizing polynomial time complexity of stream programs using interpretations (Q2346991)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Characterizing polynomial time complexity of stream programs using interpretations
scientific article

    Statements

    Characterizing polynomial time complexity of stream programs using interpretations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 May 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    stream programs
    0 references
    type-2 functionals
    0 references
    interpretations
    0 references
    polynomial time
    0 references
    basic feasible functionals
    0 references
    computable analysis
    0 references
    rewriting
    0 references
    0 references