A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent

Pascal Koiran (1) , Sylvain Perifel (2)

1 LIP - Laboratoire de l'Informatique du Parallélisme
2 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

We show that the permanent cannot be computed by DLOGTIME-uniform threshold or arithmetic circuits of depth o(log log n) and polynomial size.

Mots clés: permanent; lower bound; threshold circuits; uniform circuits; non-constant depth circuits; arithmetic circuits

Domaines: Complexité [cs.CC]

Pascal Koiran, Sylvain Perifel. A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent. 2009. ⟨hal-00360507⟩