Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs (Q5470728)

From MaRDI portal
Revision as of 21:34, 27 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5029565
Language Label Description Also known as
English
Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs
scientific article; zbMATH DE number 5029565

    Statements

    Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs (English)
    0 references
    0 references
    0 references
    1 June 2006
    0 references
    polynomial time
    0 references
    linear space
    0 references
    polynomial space
    0 references
    static program analysis
    0 references
    property testing
    0 references
    implicit computational complexity
    0 references
    imperative programming languages
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references