The equivalence of Horn and network complexity for Boolean functions (Q1160604)

From MaRDI portal
Revision as of 11:46, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The equivalence of Horn and network complexity for Boolean functions
scientific article

    Statements

    title
    The equivalence of Horn and network complexity for Boolean functions (English)
    0 references
    DOI
    10.1007/BF00289267
    0 references
    author
    Stal O. Anderaa
    0 references
    Egon Börger
    0 references
    publication date
    1981
    0 references
    Mathematics Subject Classification ID
    94C10
    0 references
    03B05
    0 references
    68Q25
    0 references
    zbMATH DE Number
    3750862
    0 references
    zbMATH Keywords
    Horn complexity
    0 references
    complexity measure for logical functions
    0 references
    Horn formula
    0 references
    quasi-Horn formula
    0 references
    OpenAlex ID
    W2042029993
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1160604&oldid=37340865"
    Powered by MediaWiki