On the relation between BDDs and FDDs (Q5096325): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Binary Decision Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast OFDD-based minimization of fixed polarity Reed-Muller expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Boolean manipulation with OBDD's can be extended to FBDD's / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified branching programs and their computational power / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easily Testable Realizations ror Logic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph driven BDDs -- a new data structure for Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction of OBDDs in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal decision trees and one-time-only branching programs for symmetric Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4885894 / rank
 
Normal rank

Latest revision as of 22:18, 29 July 2024

scientific article; zbMATH DE number 7572136
Language Label Description Also known as
English
On the relation between BDDs and FDDs
scientific article; zbMATH DE number 7572136

    Statements

    Identifiers