Author | Conference | Journal | Organization | Year | DOI
Look for results that meet for the following criteria:

Keywords (1)

Academic
Publications
Graph-based algorithms for boolean function manipulation

Graph-based algorithms for boolean function manipulation,IEEE Transactions on Computers,E. Bryant R

Edit
Graph-based algorithms for boolean function manipulation   (Citations: 818)
BibTex | RIS | RefWorks Download
Journal: IEEE Transactions on Computers - TC , 1986
Cumulative Annual
    • ...All Boolean manipulations are accomplished using Ordered Binary Decision Diagrams (OBDDs) [2]...

    Santosh Biswas, et al. A discrete event systems approach to online testing of digital VLSI ci...

    • ...An ordered binary decision diagram (OBDD) is a directed acyclic graph with a fixed variable ordering to represent Boolean functions [2]...
    • ...The derivation of the best variable ordering in an OBDD has been proved to be the co-NP complete [2]; many heuristic methods have also been proposed...
    • ...The algorithms in [2], called "Coalgebraic" in the tables, is a type of traditional method, whereas the method in [4], called as "RENO" in the tables, uses a transduction-based mechanism, and the method in [9] called "VAR" in the tables, presents another sort of technique...

    Pei-Yung Hsiao, et al. Using ordered binary decision diagrams to factorize multi-level logic

Sort by:

Citations (818)

Share this on