 Multiplication lies outside of AC0["p"] for any prime "p", meaning there is no family of constant-depth, polynomial (or even subexponential) size circuits using AND, OR, NOT, and MOD"p" gates that can compute a product.This follows from a constant-depth reduction of MOD"q" to multiplication.Lower bounds for multiplication are also known for some classes of branching programs.