TY  - JOUR
AU  - N. P. Red'kin
TI  - On the complexity of Boolean functions with a small number of ones
JO  - Diskretnaya Matematika
PY  - 2004
SP  - 20
EP  - 31
VL  - 16
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2004_16_4_a2/
LA  - ru
ID  - DM_2004_16_4_a2
ER  -