Graph-driven free parity BDDs: Algorithms and lower bounds
2001 | Konferenzbeitrag. Eine Publikation mit Affiliation zur Georg-August-Universität Göttingen.
Spring zu: Zitieren & Links | Dokumente & Medien | Details | Versionsgeschichte
Zitiervorschlag
Graph-driven free parity BDDs: Algorithms and lower bounds
Brosenne, H. ; Homeister, M. & Waack, S. (2001)
In:Sgall, Jiří (Ed.), Mathematical foundations of computer science 2001 pp. 212-223. 26th International Symposium on Mathematical Foundations of Computer Science, Mariánské Lázně, Czech Republic.
Berlin: Springer.
Dokumente & Medien
Details
- Autor(en)
- Brosenne, H. ; Homeister, M.; Waack, S.
- Herausgeber
- Sgall, Jiří
- Zusammenfassung
- We investigate graph-driven free paxity 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.
- Erscheinungsdatum
- 2001
- Herausgeber
- Springer
- Konferenz
- 26th International Symposium on Mathematical Foundations of Computer Science
- Serie
- Lecture Notes in Computer Science
- ISBN
- 3-540-42496-2
- Veranstaltungsort
- Mariánské Lázně, Czech Republic
- Veranstaltungsstart
- 2001-08-27
- Veranstaltungsende
- 2001-08-31
- ISSN
- 0302-9743
- Sprache
- Englisch
