The power of the middle bit

The class of languages that can be recognized in polynomial time with the additional information of one bit from a P function is studied. In particular, it is shown that every Mod/sub k/P class and every class contained in PH are low for this class. These results are translated to the area of circuit complexity using MidBit (middle bit) gates. It is shown that every language in ACC can be computed by a family of depth-2 deterministic circuits of size 2 to the (log n)/sup c/ power with a MidBit gate at the root and AND-gates of fan-in (log n)/sup c/ at the leaves. This result improves the known upper bounds for the class ACC.<<ETX>>

[1]  Jacobo Torán,et al.  Turing Machines with Few Accepting Computations and Low Sets for PP , 1992, J. Comput. Syst. Sci..

[2]  David A. Mix Barrington,et al.  Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 , 1986, STOC '86.

[3]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[4]  Eric Allender,et al.  A note on the power of threshold circuits , 1989, 30th Annual Symposium on Foundations of Computer Science.

[5]  U. Hertrampt.  Relations among MOD-classes , 1990 .

[6]  Stathis Zachos,et al.  Robustness of Probabilistic Computational Complexity Classes under Definitional Perturbations , 1982, Inf. Control..

[7]  Ian Parberry,et al.  On the Construction of Parallel Computers from Various Bases of Boolean Functions , 1986, Theor. Comput. Sci..

[8]  Jacobo Torán.  An oracle characterization of the counting hierarchy , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[9]  Seinosuke Toda.  On the computational power of PP and (+)P , 1989, 30th Annual Symposium on Foundations of Computer Science.

[10]  C. Papadimitriou,et al.  Two remarks on the power of counting , 1983 .

[11]  Jacobo Torán,et al.  Turning machines with few accepting computations and low sets for PP , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[12]  Andrew Chi-Chih Yao,et al.  ON ACC and threshold circuits , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[13]  Eric Allender,et al.  On the Power of Uniform Families of Constant Depth Treshold Circuits , 1990, MFCS.

[14]  John Gill,et al.  Computational Complexity of Probabilistic Turing Machines , 1977, SIAM J. Comput..

[15]  John Gill,et al.  Counting Classes: Thresholds, Parity, Mods, and Fewness , 1990, Theor. Comput. Sci..

[16]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

[17]  Uwe Schöning,et al.  A Low and a High Hierarchy within NP , 1983, J. Comput. Syst. Sci..