Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds

Authors:
Henrik Brosenne;Matthias Homeister;Stephan Waack
Affiliations:
-;-;-
Venue:
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Year:
2001

Citing 11
Cited 2

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Entropy of contact circuits and lower bounds on their complexity

Theoretical Computer Science - International Symposium on Mathematical Foundations of Computer Science, Bratisl
Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication

IEEE Transactions on Computers
Graph driven BDDs—a new data structure for Boolean functions

Theoretical Computer Science
Mod-2-OBDDs—a data structure that generalizes EXOR-sum-of-products and ordered binary decision diagrams

Formal Methods in System Design
Linear codes are hard for oblivious read-once parity branching programs

Information Processing Letters
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Frontiers of Feasible and Probabilistic Feasible Boolean Manipulation with Branching Programs

STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams

STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science

A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate graph-driven free parity BDDs, which strictly generalize the two well-known models parity OBDDs and graph-driven free BDDs. The first main result of this paper is a polynomial time algorithm that minimizes the number of nodes in a graph-driven free parity BDD. The second main result is an exponential lower bound on the size of graph-driven free parity BDD for linear code functions.