On random orderings of variables for parity ordered binary decision diagrams

DOI<233::AID-RSA1>3.0.CO;2-Q 10.1002/(SICI)1098-2418(200005)16:3<233::AID-RSA1>3.0.CO;2-QzbMath0952.68067OpenAlexW2100984651MaRDI QIDQ4487092

Petr Savický

Publication date: 14 January 2001

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(200005)16:3<233::aid-rsa1>3.0.co;2-q

zbMATH Keywords

Boolean functionsordered binary decision diagrams

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Circuits, networks (94C99)

Cites Work

• Parity OBDDs cannot be handled efficiently enough
• Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC
• Graph-Based Algorithms for Boolean Function Manipulation
• Improving the variable ordering of OBDDs is NP-complete

This page was built for publication: On random orderings of variables for parity ordered binary decision diagrams