Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds
Author: | Henrik Brosenne, Matthias HomeisterGND, Stephan Waack |
---|---|
DOI: | https://doi.org/10.1007/3-540-44683-4_19 |
ISBN: | 978-3-540-44683-5 (Online) |
Parent Title (English): | Mathematical foundations of computer science 2001 : 26th international symposium ; proceedings / MFCS 2001, Mariánské Lázně, Czech Republic, August 27 - 31, 2001 |
Series (Serial Number): | Lecture notes in computer science (2136) |
Publisher: | Springer |
Place of publication: | Berlin [u.a.] |
Editor: | Jiří Sgall |
Document Type: | Conference Proceeding |
Language: | English |
Year of Publishing: | 2001 |
Date of Publication (online): | 2017/03/02 |
Release Date: | 2017/03/02 |
First Page: | 212 |
Last Page: | 223 |
Dewey Decimal Classification: | Informatik, Informationswissenschaft, allgemeine Werke / Informatik, Wissen, Systeme / Datenverarbeitung; Informatik |
Naturwissenschaften und Mathematik / Mathematik / Mathematik | |
University Bibliography: | Hochschulbibliografie |
Licence (German): | Creative Commons - Namensnennung-Nicht kommerziell-Keine Bearbeitung |