David A. Mix Barrington

Uniform constant-depth threshold circuits for division and iterated multiplication

It has been known since the mid-1980s (SIAM J. Comput. 15 (1986) 994; SIAM J. Comput. 21 (1992) 896) that integer division can be performed by poly-time uniform constant-depth circuits of MAJORITY gates; equivalently, the division problem lies in P-uniform TC0. Recently, this was improved to L-uniform TC0 (RAIRO Theoret. Inform. Appl. 35 (2001) 259), but it remained unknown whether division can be performed by DLOGTIME-uniform TC0 circuits. The DLOGTIME uniformity condition is regarded by many as being the most natural notion of uniformity to apply to small circuit complexity classes such as TC0; DLOGTIME-uniform TC0 is also known as FOM, because it corresponds to first-order logic with MAJORITY quantifiers, in the setting of finite model theory. Integer division has been the outstanding example of a natural problem known to be in a P-uniform circuit complexity class, but not known to be in its DLOGTIME-uniform version.We show that indeed division is in DLOGTIME-uniform TC0. First we show that division lies in the complexity class FOM + POW obtained by augmenting FOM with a predicate for powering modulo small primes. Then we show that the predicate POW itself lies in FOM. (In fact, it lies in FO, or DLOGTIME-uniform AC0.)The essential idea in the fast parallel computation of division and related problems is that of Chinese remainder representation (CRR)--storing a number in the form of its residues modulo many small primes. The fact that CRR operations can be carried out in log space has interesting implications for small space classes. We define two versions of s(n) space for s(n) = o(log n): dspace(s(n)) as the traditional version where the worktape begins blank, and DSPACE(s(n)) where the space bound is established by endmarkers before the computation starts. We present a new translational lemma characterizing the unary languages in the DSPACE classes. It is known (Theoret. Comput. Sci. 3 (1976) 213) that {0n : n is prime} ∉ dspace(log logn). We show that if this can be improved to {0n:n is prime} ∉ DSPACE(log log n), it follows that L ≠ NP.

Representing Boolean functions as polynomials modulo composite numbers

AbstractDefine the MODm-degree of a boolean functionF to be the smallest degree of any polynomialP, over the ring of integers modulom, such that for all 0–1 assignments

A lower bound on the mod 6 degree of the OR function

\vec x

Bounded Depth Arithmetic Circuits: Counting and Closure

,

Equation Satisfiability and Program Satisfiability for Finite Monoids

F(\vec x) = 0

Complex polynomials and circuit lower bounds for modular counting

iff