computational complexity

, Volume 4, Issue 4, pp 350–366

On ACC

  • Richard Beigel
  • Jun Tarui
Article
  • 136 Downloads

Abstract

We show that every languageL in the class ACC can be recognized by depth-two deterministic circuits with a symmetric-function gate at the root and\(2^{\log ^{O(1)} n} \) AND gates of fan-in logO(1)n at the leaves, or equivalently, there exist polynomialspn(x1,..., xn) overZ of degree logO(1)n and with coefficients of magnitude\(2^{\log ^{O(1)} n} \) and functionshn:Z→{0,1} such that for eachn and eachx∈{0,1}n,XL(x)=hn(pn(x1,...,xn)). This improves an earlier result of Yao (1985). We also analyze and improve modulus-amplifying polynomials constructed by Toda (1991) and Yao (1985).

Subject classifications

68Q05 68Q15 68Q25 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Birkhäuser Verlag 1994

Authors and Affiliations

  • Richard Beigel
    • 1
  • Jun Tarui
    • 2
  1. 1.Dept. of Computer ScienceUniversity of YaleNew HavenU.S.A.
  2. 2.Department of Communications & Systems EngineeringUniversity of Electro-CommunicationsTokyoJapan

Personalised recommendations