Carnegie Mellon University
Browse

On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication

journal contribution
posted on 1991-01-01, 00:00 authored by Randal BryantRandal Bryant
Institute for Software Research

History

Date

1991-01-01

Usage metrics

    Categories

    Keywords

    Binary decision diagramsBoolean functionsVLSI complexitymultiplicationComputer Software not elsewhere classified

    Licence

    In Copyright

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC