Complexity of fixed point counting problems in Boolean networks (Q2119407)

From MaRDI portal
Revision as of 16:11, 31 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Complexity of fixed point counting problems in Boolean networks
scientific article

    Statements

    Complexity of fixed point counting problems in Boolean networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 March 2022
    0 references
    complexity
    0 references
    Boolean networks
    0 references
    fixed points
    0 references
    interaction graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references