Computational complexity of finite asynchronous cellular automata (Q517039)

From MaRDI portal
Revision as of 14:00, 13 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computational complexity of finite asynchronous cellular automata
scientific article

    Statements

    title
    Computational complexity of finite asynchronous cellular automata (English)
    0 references
    author
    Alberto Dennunzio
    0 references
    Enrico Formenti
    0 references
    Luca Manzoni
    0 references
    Giancarlo Mauri
    0 references
    Antonio E. Porreca
    0 references
    publication date
    16 March 2017
    0 references
    Mathematics Subject Classification ID
    68Q80
    0 references
    68Q17
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6695328
    0 references
    zbMATH Keywords
    natural computing
    0 references
    asynchronous cellular automata
    0 references
    computational complexity
    0 references
    Wikidata QID
    Q57518141
    0 references
    OpenAlex ID
    W2212525746
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q517039&oldid=36310979"
    Powered by MediaWiki