Abstract
We present improved uniform TC 0 circuits for division, matrix powering, and related problems, where the improvement is in terms of "majority depth" (as studied by Maciel and Thérien). 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. © 2014 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Allender, E., Balaji, N., & Datta, S. (2014). Low-depth uniform threshold circuits and the bit-complexity of straight line programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8635 LNCS, pp. 13–24). Springer Verlag. https://doi.org/10.1007/978-3-662-44465-8_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
