The complexity of modular decomposition of Boolean functions (Q2387426)

From MaRDI portal
Revision as of 22:18, 3 August 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
The complexity of modular decomposition of Boolean functions
scientific article

    Statements

    The complexity of modular decomposition of Boolean functions (English)
    0 references
    0 references
    2 September 2005
    0 references
    Boolean function
    0 references
    computational complexity
    0 references
    modular set
    0 references
    modular closure
    0 references
    generalized Shannon decomposition
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references