On ACC and Threshold Circuits

We prove that any language in ACC can be approximately computed by two-level circuits of size 2('Ogn)', with a symmetric-function gate at the top and only AND gates on the first level. This implies that any language in ACC can be recognized by depth3 threshold circuits of size 2('"gn)'. This result gives the first nontrivial upper bound on the computing… (More)