Shielding circuits with groups
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Iterated group products and leakage resilience against NC1
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |
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 be simulated by a constant width (width 5) branching program of length $s^{1.811\ldots}$. A lower bound for the translational cost from formulae to permutation branching programs is also presented.