scientific article; zbMATH DE number 1423227

MaRDI QIDQ4946959zbMATH OpenFDO

Authors Detlef Sieling, Ingo Wegener

Publication date 20 November 2003

zbMATH Keywords

Boolean functionscomputational complexityordered multiple-valued decision diagramspartially symmetric functionsrandom functionsvariable orderings

Mathematics Subject Classification ID

Boolean functions (06E30) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Variable orderings and the size of OBDDs for random partially symmetric Boolean functions
• On the structure of counterexamples to symmetric orderings for BDD's
• On the relation between BDDs and FDDs
• On random orderings of variables for parity ordered binary decision diagrams

Cited in

(4)

• Optimal ordered binary decision diagrams for read-once formulas
• On the structure of counterexamples to symmetric orderings for BDD's
• Variable orderings and the size of OBDDs for random partially symmetric Boolean functions
• De Bruijn sequences and complexity of symmetric functions

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 Q4946959)