• search hit 18 of 28
Back to Result List

Lower bounds for restricted read-once parity branching programs

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics
Metadaten
Author:Matthias Homeister
DOI:https://doi.org/10.1016/j.tcs.2006.01.052
ISSN:0304-3975; 1879-2294
Parent Title (English):Theoretical Computer Science
Document Type:Article
Language:English
Year of Publishing:2006
Date of Publication (online):2017/02/28
Release Date:2017/02/28
Tag:Computational complexity; Lower bounds; Read-once parity branching programs
Volume:359
Issue:1-3
First Page:1
Last Page:14
Dewey Decimal Classification:Informatik, Informationswissenschaft, allgemeine Werke / Informatik, Wissen, Systeme / Datenverarbeitung; Informatik
University Bibliography:Hochschulbibliographie
Licence (German):Creative Commons - Namensnennung-Nicht kommerziell-Keine Bearbeitung