The complexity of the representation of multiple-output Boolean functions (Q332335)

From MaRDI portal
Revision as of 21:09, 12 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
The complexity of the representation of multiple-output Boolean functions
scientific article

    Statements

    The complexity of the representation of multiple-output Boolean functions (English)
    0 references
    8 November 2016
    0 references
    Boolean function
    0 references
    Shannon function
    0 references
    complexity
    0 references
    Toffoli gates
    0 references
    reversible circuits
    0 references
    Reed-Muller forms
    0 references

    Identifiers