Subquadratic simulations of circuits by branching programs

Authors:
J.-Y. Cai;R. J. Lipton
Affiliations:
Dept. of Comput. Sci., Princeton Univ., NJ, USA;Dept. of Comput. Sci., Princeton Univ., NJ, USA
Venue:
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Year:
1989

Citing 0
Cited 1

Relating branching program size and formula size over the full binary basis

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Boolean circuits and their simulations by bounded-width branching programs are considered. It is shown that every NC/sup 1/ circuit of size s can be simulated by a constant-width branching program of length s/sup 1.811. . ./. Some related group-theoretic results are presented.