scientific article; zbMATH DE number 1500660

zbMATH Open0958.68071MaRDI QIDQ4501682FDOQ4501682

Authors: Detlef Sieling 

Publication date: 4 September 2000

Title of this publication is not available (Why is that?)

Recommendations

• Lower bounds for linearly transformed OBDDs and FBDDs
• A comparison of free BDDs and transformed BDDs
• On the size of binary decision diagrams representing Boolean functions
• Efficient Boolean manipulation with OBDD's can be extended to FBDD's
• On the computational power of linearly transformed BDDs

zbMATH Keywords

branching programs or binary decision diagrams

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (3)

• Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs
• Lower bounds for linearly transformed OBDDs and FBDDs
• Lower bounds for restricted read-once parity branching programs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501682)