Symmetric and Threshold Boolean Functions Are Exhaustive (Q3041088)

From MaRDI portal
Revision as of 10:28, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Symmetric and Threshold Boolean Functions Are Exhaustive
scientific article

    Statements

    title
    Symmetric and Threshold Boolean Functions Are Exhaustive (English)
    0 references
    author
    Bernard M. E. Moret
    0 references
    Michael G. Thomason
    0 references
    Rafael C. Gonzalez
    0 references
    publication date
    1983
    0 references
    zbMATH DE Number
    3833864
    0 references
    zbMATH Keywords
    Boolean functions
    0 references
    decision tree
    0 references
    multiplexer tree
    0 references
    threshold function
    0 references
    worst-case testing cost
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3041088&oldid=27451327"
    Powered by MediaWiki