Expressibility and Parallel Complexity (Q4207580)

From MaRDI portal
Revision as of 14:28, 20 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q61687225, #quickstatements; #temporary_batch_1705753332619)
scientific article; zbMATH DE number 4128384
Language Label Description Also known as
English
Expressibility and Parallel Complexity
scientific article; zbMATH DE number 4128384

    Statements

    title
    Expressibility and Parallel Complexity (English)
    0 references
    DOI
    10.1137/0218043
    0 references
    author
    Neil Immerman
    0 references
    publication date
    1989
    0 references
    zbMATH DE Number
    4128384
    0 references
    zbMATH Keywords
    parallel RAM
    0 references
    uniformity of circuits
    0 references
    first order expressibility
    0 references
    CRCW RAM
    0 references
    polynomial time hiearchy
    0 references
    Wikidata QID
    Q61687225
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4207580&oldid=11872207"
      Powered by MediaWiki