Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs (Q2407103)

From MaRDI portal
Revision as of 12:13, 14 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 studies of synchronous Boolean finite dynamical systems on directed graphs
scientific article

    Statements

    Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs (English)
    0 references
    0 references
    0 references
    28 September 2017
    0 references

    Identifiers