Skip to main content
Conference Proceedings

Graph-driven free parity BDDS: Algorithms and lower bounds

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2136 212-223
DOI: 10.1007/3-540-44683-4_19
9Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Brosenne, H., Homeister, M., & Waack, S. (2001). Graph-driven free parity BDDS: Algorithms and lower bounds. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2136, pp. 212–223). Springer Verlag. https://doi.org/10.1007/3-540-44683-4_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free