http://dcherukhin.i2p/research/research.htm
(статья: pdf ,
рукопись: ps.gz , tex.tgz ) Lower Bounds for Boolean Circuits with Finite Depth and Arbitrary Gates //
Electronic Colloquium on Computational Complexity, Report No. 32 (2008)
[ pdf , tex.tgz ;
reviews: 1 2 3 4 5 6 ; link: ECCC ] Abstract: We consider bounded depth circuits over an arbitrary field
$K$. If the field $K$
is finite, then we allow arbitrary gates $K^n \to K$.