The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions (Q4419798)

From MaRDI portal
Revision as of 03:52, 29 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1964145
Language Label Description Also known as
English
The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions
scientific article; zbMATH DE number 1964145

    Statements

    The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions (English)
    0 references
    0 references
    16 October 2003
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references