TY  - JOUR
AU  - D. Yu. Cherukhin
TI  - Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
JO  - Diskretnaya Matematika
PY  - 2011
SP  - 39
EP  - 47
VL  - 23
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2011_23_4_a2/
LA  - ru
ID  - DM_2011_23_4_a2
ER  -