On lower bounds for read-k-times branching programs

Abstract: A syntactic read-k-times branching program has the restriction thatno variable occurs more than k times on any path (whether or not consistent) ofthe branching program. Werst extend the result in [30], to show that the \n=2clique only function", which is easily seen to be computable by deterministicpolynomial size read-twice programs, cannot be computed by nondeterministicpolynomial size read-once programs, although its complement can be socomputed. We then exhibit an explicit...