An improved hierarchy result for partitioned BDDs

DOI10.1007/S002240010005zbMath0961.68056OpenAlexW2057257783MaRDI QIDQ1587372

Martin Sauerhoff

Publication date: 7 December 2000

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002240010005

zbMATH Keywords

complexity of Boolean functionpartitioned binary decision diagrams

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (3)

On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-\(k\)-times branching programs ⋮ Width hierarchy for \(k\)-OBDD of small width ⋮ A hierarchy result for read-once branching programs with restricted parity nondeterminism

This page was built for publication: An improved hierarchy result for partitioned BDDs