Least upper bounds for the size of OBDDs using symmetry properties

DOI10.1109/12.844348zbMath1392.68153OpenAlexW2162833026MaRDI QIDQ4571359

Paul Molitor, Laura Heinrich-Litan

Publication date: 9 July 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/14e30e1be62d41cc5bd167a7d9c46caf4a5351ac

Mathematics Subject Classification ID

Boolean functions (06E30) Data structures (68P05)

Related Items (3)

Transitive q-Ary Functions over Finite Fields or Finite Sets: Counts, Properties and Applications ⋮ De Bruijn sequences and complexity of symmetric functions ⋮ On the Structure of Counterexamples to Symmetric Orderings for BDD's

This page was built for publication: Least upper bounds for the size of OBDDs using symmetry properties