The complexity of the descriptiveness of Boolean circuits over different sets of gates (Q2464338)

From MaRDI portal
Revision as of 08:14, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
The complexity of the descriptiveness of Boolean circuits over different sets of gates
scientific article

    Statements

    The complexity of the descriptiveness of Boolean circuits over different sets of gates (English)
    0 references
    0 references
    0 references
    19 December 2007
    0 references
    Boolean function
    0 references

    Identifiers