Title :
A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent
Author :
Koiran, Pascal ; Perifel, Sylvain
Author_Institution :
LIP, Ecole Normale Super. de Lyon, Lyon, France
Abstract :
We show that the permanent cannot be computed by DLOGTIME-uniform threshold or arithmetic circuits of depth o(log log n) and polynomial size.
Keywords :
computational complexity; polynomials; DLOGTIME-uniform threshold; arithmetic circuits; polynomial size; superpolynomial lower bound; uniform nonconstant-depth threshold circuits; Arithmetic; Circuits; Complexity theory; Computational complexity; Dark states; Polynomials; Turing machines; arithmetic circuits; lower bound; non-constant depth circuits; permanent; threshold circuits; uniform circuits;
Conference_Titel :
Computational Complexity, 2009. CCC '09. 24th Annual IEEE Conference on
Conference_Location :
Paris
Print_ISBN :
978-0-7695-3717-7
DOI :
10.1109/CCC.2009.19
