Division Is In Uniform TC0
Integer division has been known since 1986 [4 13 12] to be in slightly non-uniform TC0, i.e., computable by polynomial-size, constant depth threshold circuits. This has been perhaps the outstanding natural problem known to be in a standard circuit complexity class, but not known to be in its uniform version. We show that indeed division is in uniform TC0. A key step of our proof is the discovery of a first-order formula expressing exponentiation modulo any number of polynomial size.
KeywordsInput Size Division Problem Iterate Multiplication Threshold Gate Turing Reduction
Unable to display preview. Download preview PDF.
- 1.M. Ajtai and M. Ben-Or. A theorem on probabilistic constant depth computations. In ACM Symposium on Theory of Computing (STOC’ 84), pages 471–474, 1984. ACM Press.Google Scholar
- 2.E. Allender, D. A. Mix Barrington, and W. Hesse. Uniform circuits for division: Consequences and problems. To appear in Proceedings of the 16th Annual IEEE Conference on Computational Complexity (CCC-2001), 2001. IEEE Computer Society.Google Scholar
- 5.A. Chiu, G. Davida, and B. Litow. NC1 division. online at http://www.cs.jcu.edu.au/~bruce/papers/crr00_3.ps.gz.
- 8.M. Furst, J. B. Saxe, and M. Sipser. Parity, circuits, and the polynomial-time hierarchy. In 22nd Annual Symposium on Foundations of Computer Science, 260–270, 1981. IEEE.Google Scholar
- 9.J. Hastad. Almost optimal lower bounds for small depth circuits. In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, 6–20, 1986.Google Scholar
- 12.J. H. Reif. On threshold circuits and polynomial computation. In Proceedings, Structure in Complexity Theory, Second Annual Conference, pages 118–123, IEEE Computer Society Press.Google Scholar