Division Is in Uniform TC~0

摘要

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