scientific article; zbMATH DE number 512863

MaRDI QIDQ4281560zbMATH OpenFDO

Authors Jordan Gergov, Christoph Meinel

Publication date 26 September 1994

zbMATH Keywords

Boolean functionsbranching programscircuit designscomputer aided designfunctional specificationsymbolic Boolean manipulation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer science aspects of computer-aided design (68U07) Symbolic computation and algebraic computation (68W30) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 58305
• Branching Programs and Binary Decision Diagrams
• On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs

Cited in

(9)

• A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs
• On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs
• Efficient data structures for Boolean functions
• Minimization problems for parity OBDDs
• Lower bounds for restricted read-once parity branching programs
• Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs
• Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs
• New lower bounds and hierarchy results for restricted branching programs
• 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 Q4281560)