scientific article; zbMATH DE number 58305

MaRDI QIDQ4005192zbMATH OpenFDO

Authors Christoph Meinel

Publication date 27 September 1992

zbMATH Keywords

Boolean functionscomputer-aided circuit designlogic synthesisrepresentation of logic functions

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 61460
• scientific article; zbMATH DE number 4060726
• Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits
• Branching Programs and Binary Decision Diagrams
• Branch distance optimization of structured programs
• Modified branching programs and their computational power
• Time-space trade-offs for branching programs
• Time-space tradeoffs for branching programs

Cited in

(5)

• On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs
• scientific article; zbMATH DE number 512863 (Why is no real title available?)
• scientific article; zbMATH DE number 512939 (Why is no real title available?)
• Branching Programs and Binary Decision Diagrams
• On the complexity of constructing optimal ordered binary decision diagrams

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 Q4005192)