Study of the complexity of an algorithm to derive the complement of a binary function (Q3352504)

From MaRDI portal
Revision as of 17:28, 21 June 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
Study of the complexity of an algorithm to derive the complement of a binary function
scientific article

    Statements

    Study of the complexity of an algorithm to derive the complement of a binary function (English)
    0 references
    1989
    0 references
    0 references
    complement of a binary function
    0 references
    combinational logic
    0 references
    programmable logic arrays
    0 references
    0 references