• DocumentCode
    3151972
  • Title

    The power of the middle bit

  • Author

    Green, Frederic ; Kobler, Johannes ; Toran, J.

  • Author_Institution
    Dept. of Math., Clark Univ., Worcester, MA, USA
  • fYear
    1992
  • fDate
    22-25 Jun 1992
  • Firstpage
    111
  • Lastpage
    117
  • Abstract
    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 ModkP 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)c power with a MidBit gate at the root and AND-gates of fan-in (log n)c at the leaves. This result improves the known upper bounds for the class ACC
  • Keywords
    computational complexity; logic circuits; logic gates; ACC language; AND-gates; MidBit gate; ModkP class; PH; circuit complexity; depth-2 deterministic circuits; fan-in; middle bit gates; polynomial time recognition; size 2 deterministic circuits; upper bounds; Circuits; Complexity theory; Contracts; Jacobian matrices; Polynomials; Turing machines; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Structure in Complexity Theory Conference, 1992., Proceedings of the Seventh Annual
  • Conference_Location
    Boston, MA
  • Print_ISBN
    0-8186-2955-X
  • Type

    conf

  • DOI
    10.1109/SCT.1992.215386
  • Filename
    215386
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3151972