Complexity Results for POMSET Languages (Q3136615)

From MaRDI portal
Revision as of 16:11, 1 March 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Complexity Results for POMSET Languages
scientific article

    Statements

    title
    Complexity Results for POMSET Languages (English)
    0 references
    DOI
    10.1137/0406035
    0 references
    author
    Joan Feigenbaum
    0 references
    Jeremy Kahn
    0 references
    Carstent Lund
    0 references
    publication date
    14 October 1993
    0 references
    zbMATH DE Number
    425597
    0 references
    zbMATH Keywords
    pomset language
    0 references
    \(\Pi^ P_ 2\)-complete
    0 references
    pomset
    0 references
    concurrent system
    0 references
    membership
    0 references
    NP-complete
    0 references
    containment
    0 references
    equality
    0 references
    graph-isomorphism
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3136615&oldid=24147733"
    Powered by MediaWiki