Name
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 |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1109/SCT.1992.215386 | Boston, MA |
Keywords | DocType | ISBN |
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 | Conference | 0-8186-2955-X |
Citations | PageRank | References |
13 | 1.62 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Frederic Green | 1 | 13 | 1.62 |
| Johannes Köbler | 2 | 580 | 46.51 |
| Jacobo Torán | 3 | 564 | 49.26 |