The Complexity of the Equivalence Problem for Simple Programs (Q3912019)

From MaRDI portal
Revision as of 23:43, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Complexity of the Equivalence Problem for Simple Programs
scientific article

    Statements

    The Complexity of the Equivalence Problem for Simple Programs (English)
    0 references
    0 references
    0 references
    0 references
    1981
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    simple programming languages
    0 references
    Presburger formulas
    0 references
    counter machines
    0 references
    polynomial space
    0 references
    polynomial time
    0 references
    NP-complete
    0 references
    0 references