@inproceedings{10.1007/978-3-662-44465-8_2,
Abstract = {We present improved uniform TC0 circuits for division, matrix powering, and related problems, where the improvement is in terms of ``majority depth'' (as studied by Maciel and Th{\'e}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.},
Address = {Berlin, Heidelberg},
Author = {Allender, Eric and Balaji, Nikhil and Datta, Samir},
BookTitle = {Mathematical Foundations of Computer Science 2014},
Editor = {Csuhaj-Varj{\'u}, Erzs{\'e}bet and Dietzfelbinger, Martin and {\'E}sik, Zolt{\'a}n},
File = {Low-depth uniform threshold circuits and the bitcomplexity of straight-line programs - 978-3-662-44465-8\_2.pdf},
ISBN = {978-3-662-44465-8},
Pages = {13--24},
Publisher = {Springer Berlin Heidelberg},
Title = {Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs},
Year = {2014},
date-added = {2023-10-06 15:14:21 +0200},
date-modified = {2023-10-06 15:14:21 +0200},
doi = {10.1007/978-3-662-44465-8_2}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A