A simple function that requires exponential size read-once branching programs
References (21)
∑11-formulae on finite structures
Ann. Pure Appl. Logic
(1983)- et al.
A lower bound for read-once branching programs
J. Comput. System Sci.
(1987) Entropy of contact circuits and lower bound on their complexity
Theoret. Comput. Sci.
(1988)- et al.
Separating the eraser Turing machine classes Le, NLe, co-NLe and Pe
Theoret. Comput. Sci.
(1991) - et al.
Two lower bounds for branching programs
- et al.
On lower bounds for read-k-times branching programs
Comput. Complexity
(1993) Lower bounds on the complexity of 1-time only branching programs
- et al.
Parity, circuits and the polynomial time hierarchy
Math. Systems Theory
(1984) Almost optimal lower bounds for small depth circuits
A note on read-k-times branching programs
RAIRO Théor. Inform. Appl.
(1995)
There are more references available in the full text version of this article.
Cited by (19)
The simplified weighted sum function and its average sensitivity
2016, Information Processing LettersAlmost k-wise independence and hard Boolean functions
2003, Theoretical Computer ScienceLower bounds for linearly transformed OBDDs and FBDDs
2002, Journal of Computer and System SciencesTime-space tradeoffs for branching programs
2001, Journal of Computer and System SciencesSize of OBDD representation of 2-level redundancies functions
2001, Theoretical Computer ScienceA read-once lower bound and a (1,+ k)-hierarchy for branching programs
2000, Theoretical Computer Science
Copyright © 1997 Published by Elsevier B.V.