The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions

DOI10.1007/3-540-57899-4_57zbMath1528.68097OpenAlexW1536220277MaRDI QIDQ6143981

Ingo Wegener

Publication date: 5 January 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57899-4_57

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Structure theory of Boolean algebras (06E05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph driven BDDs -- a new data structure for Boolean functions
• On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
• Graph-Based Algorithms for Boolean Function Manipulation
• On the OBDD-representation of general Boolean functions

This page was built for publication: The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions