Variable orderings and the size of OBDDs for random partially symmetric Boolean functions

DOI<49::AID-RSA3>3.0.CO;2-S 10.1002/(SICI)1098-2418(199808)13:1<49::AID-RSA3>3.0.CO;2-SzbMath0959.68512OpenAlexW2048954734MaRDI QIDQ4705323

Detlef Sieling

Publication date: 19 December 1999

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199808)13:1<49::aid-rsa3>3.0.co;2-s

zbMATH Keywords

ordered binary decision diagramsrandom Boolean matricesrandom partially symmetric functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (3)

On the Structure of Counterexamples to Symmetric Orderings for BDD's ⋮ Partially Symmetric Functions Are Efficiently Isomorphism Testable ⋮ The nonapproximability of OBDD minimization

This page was built for publication: Variable orderings and the size of OBDDs for random partially symmetric Boolean functions