Parity OBDDs cannot be handled efficiently enough

DOI10.1016/S0020-0190(98)00113-6zbMATH Open1338.68054OpenAlexW2085365804MaRDI QIDQ293348FDOQ293348

Authors: Detlef Sieling, Ingo Wegener, Martin Löbbing 

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

Recommendations

• On the descriptive and algorithmic power of parity ordered binary decision diagrams
• scientific article; zbMATH DE number 1759434
• On the descriptive and algorithmic power of parity ordered binary decision diagrams
• Minimization problems for parity OBDDs
• scientific article; zbMATH DE number 1324659

zbMATH Keywords

data structurestheory of computationparity OBDDsreduction algorithm

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Title not available (Why is that?)
• On random orderings of variables for parity ordered binary decision diagrams
• On the descriptive and algorithmic power of parity ordered binary decision diagrams

This page was built for publication: Parity OBDDs cannot be handled efficiently enough

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293348)