[1991] Proceedings 32nd Annual Symposium of 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 and R. Beigel, "On ACC (circuit complexity),"

*[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science(FOCS)*, San Juan, Puerto Rico, 1991, pp. 783-792.

doi:10.1109/SFCS.1991.185449

CITATIONS