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

From MaRDI portal
Revision as of 14:22, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
The Complexity of the Equivalence Problem for Simple Programs
scientific article

    Statements

    title
    The Complexity of the Equivalence Problem for Simple Programs (English)
    0 references
    DOI
    10.1145/322261.322270
    0 references
    author
    Eitan M. Gurari
    0 references
    Oscar H. Ibarra
    0 references
    publication date
    1981
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68Q65
    0 references
    68Q60
    0 references
    68Q05
    0 references
    zbMATH DE Number
    3723858
    0 references
    zbMATH Keywords
    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
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3912019&oldid=28175297"
    Powered by MediaWiki