An asymptotically optimal lower bound on the OBDD size of the middle bit of multiplication for the pairwise ascending variable order (Q708357)

From MaRDI portal
Revision as of 08:14, 3 July 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
An asymptotically optimal lower bound on the OBDD size of the middle bit of multiplication for the pairwise ascending variable order
scientific article

    Statements

    An asymptotically optimal lower bound on the OBDD size of the middle bit of multiplication for the pairwise ascending variable order (English)
    0 references
    0 references
    11 October 2010
    0 references
    0 references
    multiplication
    0 references
    middle bit
    0 references
    OBDD
    0 references
    lower bound
    0 references
    universal hashing
    0 references
    0 references