Completeness and non-completeness results with respect to read-once projections

DOI10.1006/inco.1998.2710zbMath0919.68098OpenAlexW2045152601MaRDI QIDQ1271310

Ingo Wegener, Beate Bollig

Publication date: 18 February 1999

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1998.2710

zbMATH Keywords

binary decision diagramsrestricted branching programs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Graph driven BDDs -- a new data structure for Boolean functions
• Efficient data structures for Boolean functions
• Graph-Based Algorithms for Boolean Function Manipulation
• A complexity theory based on Boolean algebra
• Efficient Boolean manipulation with OBDD's can be extended to FBDD's
• Read-once projections and formal circuit verification with binary decision diagrams