Lower Bounds for General Graph–Driven Read–Once Parity Branching Programs
Author: | Henrik Brosenne, Matthias HomeisterGND, Stephan Waack |
---|---|
DOI: | https://doi.org/10.1007/978-3-540-45138-9_23 |
ISBN: | 978-3-540-40671-6 (Print) |
ISBN: | 978-3-540-45138-9 (Online) |
Parent Title (English): | Mathematical foundations of computer science 2003 : 28th international symposium ; proceedings / MFCS 2003, Bratislava, Slovakia, August 25 - 29, 2003 |
Series (Serial Number): | Lecture notes in computer science (2747) |
Publisher: | Springer |
Place of publication: | Berlin ; Heidelberg |
Editor: | Branislav Rovan |
Document Type: | Conference Proceeding |
Language: | English |
Year of Publishing: | 2003 |
Date of Publication (online): | 2017/03/02 |
Release Date: | 2017/03/02 |
First Page: | 290 |
Last Page: | 299 |
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 |