• search hit 16 of 28
Back to Result List

Lower Bounds for the Sum of Graph--driven Read--Once Parity Branching Programs

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics
Metadaten
Author:Matthias Homeister
URL:https://eccc.weizmann.ac.il/report/2003/068/
ISSN:1433-8092
Parent Title (English):Electronic colloquium on computational complexity : ECCC : research reports, surveys and books in computational complexity
Document Type:Article
Language:English
Year of Publishing:2003
Date of Publication (online):2017/03/02
Release Date:2017/03/02
Tag:Computational Complexity; lower bounds; read--once parity branching programs
Issue:Report No. 68
Pagenumber:15
Note:
Paper: TR03-068
Dewey Decimal Classification:Informatik, Informationswissenschaft, allgemeine Werke / Informatik, Wissen, Systeme / Datenverarbeitung; Informatik
Naturwissenschaften und Mathematik / Mathematik / Mathematik
University Bibliography:Hochschulbibliographie
Licence (German):Creative Commons - Namensnennung-Nicht kommerziell-Keine Bearbeitung