Division is in uniform TC°

37Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Integer division has been known since 1986 [4,13,12] to be in slightly non-uniform TC°, 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 TC°. A key step of our proof is the discovery of a first-order formula expressing exponentiation modulo any number of polynomial size. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Hesse, W. (2001). Division is in uniform TC°. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2076 LNCS, pp. 104–114). Springer Verlag. https://doi.org/10.1007/3-540-48224-5_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free