Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Matthias Homeister. Lower Bounds for the Sum of Graph--driven Read--Once Parity Branching Programs. Electronic Colloquium on Computational Complexity (ECCC), (068), 2003. [doi]
Abstract is missing.