scientific article; zbMATH DE number 1775052

MaRDI QIDQ4542178zbMATH OpenFDO

Authors Christoph Meinel, Christian Stangier

Publication date 4 August 2002

zbMATH Keywords

ordered binary decision diagrams

Mathematics Subject Classification ID

Computer system organization (68M99) Computer science aspects of computer-aided design (68U07)

Recommendations

• Graph driven BDDs -- a new data structure for Boolean functions
• scientific article; zbMATH DE number 5852793
• BDD-based Boolean functional synthesis
• Boolean function complexity. Advances and frontiers.
• scientific article; zbMATH DE number 5866337
• Boolean functional synthesis: hardness and practical algorithms

Cited in

(14)

• BDDs -- design, analysis, complexity, and applications.
• Ordered binary decision diagrams as knowledge-bases
• On the error resilience of ordered binary decision diagrams
• A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm
• New aspects in optimization of BDDs: mixed techniques based on polulations of solutions and lower bound
• Worst case examples for operations on OBDDs
• Binary decision diagrams
• scientific article; zbMATH DE number 1156875 (Why is no real title available?)
• scientific article; zbMATH DE number 1522923 (Why is no real title available?)
• scientific article; zbMATH DE number 1555978 (Why is no real title available?)
• On the relation between BDDs and FDDs (extended abstract)
• Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems
• String-matching with OBDDs
• Graph driven BDDs -- a new data structure for Boolean functions

This page was built for publication:

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