We present improved uniform TC~0 circuits for division, mar trix powering, and related problems, where the improvement is in terms of "majority depth" (as studied by Maciel and Therien). As a corollary, we obtain improved bounds on the complexity of certain problems involving arithmetic circuits, which are known to lie in the counting hierarchy.
展开▼