scientific article; zbMATH DE number 512863

zbMath0798.68078MaRDI QIDQ4281560

Jordan Gergov, Christoph Meinel

Publication date: 26 September 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computer aided designBoolean functionsbranching programsfunctional specificationcircuit designssymbolic Boolean manipulation

Mathematics Subject Classification ID

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

Related Items

Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs, Efficient data structures for Boolean functions, Graph driven BDDs -- a new data structure for Boolean functions, New lower bounds and hierarchy results for restricted branching programs, Minimization problems for parity OBDDs, Lower bounds for restricted read-once parity branching programs, A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs, Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs