width (log n) °{*). We give an fl(n log n~ log log n) lower bound for the size of such branching programs com- puting almost any symmetric Boolean fnnction ...

999-1000. ... P. Pudl~k, A lower bound on complexity branching programs, Proc. Conf. on the matical Foundations of Computer Science Springer Lecture Notes in ...

This lower bound can be achieved by a branching program which counts the number of input variables that have value 1.

An (n log n= log log n) lower bound for the size of such branching programs computing almost any symmetric Boolean function and in particular the following ...

In this section we mention two lower bounds which establish trade-offs between length and width of oblivious branching programs. Again, the machinery is easily ...

This paper considers Boolean formulae and their simulations by bounded width branching programs. It is shown that every balanced Boolean formula of size s can ...

In this work we study a restricted version of GQBP with the motivation of proving bounds on the query-space requirement of quantum-query circuits.

BOUNDS FOR WIDTH TWO BRANCHING PROGRAMS* ... severely constrained programs (those having width 2) and establish characterizations as well as lower bounds.

Abstract. We use algebraic techniques to obtain superlinear lower bounds on the size of bounded- width branching programs to solve a number of problems.

A major question in complexity theory is whether polynomial-time is the same as log-space or nondeterministic log-space. One approach to this problem is to ...