The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1991)
San Juan, Puerto Rico
Oct. 1, 1991 to Oct. 4, 1991
ISBN: 0-8186-2445-0
pp: 783-792
R. Beigel , Yale Univ., New Haven, CT, USA
ABSTRACT
It has been shown by A. Yao (1990) that every language in ACC is recognized by a sequence of depth-2 probabilistic circuits with a symmetric gate at the root and n/sup polylog/(n) AND gates of fan-in polylog (n) at the leaves. The authors simplify Yao's proof and strengthen his results: every language in ACC is recognized by a sequence of depth-2 deterministic circuits with a symmetric gate at the root and n/sup polylog/(n) AND gates of fan-in polylog(n) at the leaves. They also analyze and improve modulus-amplifying polynomials constructed by S. Toda (1989) and Yao: this yields smaller circuits in Yao's and the present results on ACC.
INDEX TERMS
modulus-amplifying polynomials, language, ACC, depth-2 probabilistic circuits, symmetric gate, root, AND gates, fan-in, leaves, depth-2 deterministic circuits
CITATION
J. Tarui, R. Beigel, "On ACC (circuit complexity)", 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, vol. 00, no. , pp. 783-792, 1991, doi:10.1109/SFCS.1991.185449
102 ms
(Ver 3.3 (11022016))