Parity OBDDs cannot be handled efficiently enough

DOI10.1016/S0020-0190(98)00113-6zbMath1338.68054OpenAlexW2085365804MaRDI QIDQ293348

Detlef Sieling, Ingo Wegener, Martin Loebbing

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001136?np=y

zbMATH Keywords

data structurestheory of computationreduction algorithmparity OBDDs

Mathematics Subject Classification ID

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

Related Items

On random orderings of variables for parity ordered binary decision diagrams

Cites Work

• Graph driven BDDs -- a new data structure for Boolean functions
• Reduction of OBDDs in linear time
• Gaussian elimination is not optimal
• Graph-Based Algorithms for Boolean Function Manipulation
• On the Asymptotic Complexity of Matrix Multiplication
• Efficient Boolean manipulation with OBDD's can be extended to FBDD's
• On the descriptive and algorithmic power of parity ordered binary decision diagrams
• Unnamed Item
• Unnamed Item
• Unnamed Item