A note on the size of OBDDs for the graph of integer multiplication (Q975522)

From MaRDI portal
Revision as of 02:54, 8 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
A note on the size of OBDDs for the graph of integer multiplication
scientific article

    Statements

    A note on the size of OBDDs for the graph of integer multiplication (English)
    0 references
    0 references
    9 June 2010
    0 references
    computational complexity
    0 references
    integer multiplicaton
    0 references
    lower bounds
    0 references
    ordered binary decision diagrams
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references