TY  - JOUR
AU  - A. S. Kazimirov
AU  - S. Yu. Reymerov
TI  - Computational bound on complexity of polynomial representations of Boolean functions
JO  - The Bulletin of Irkutsk State University. Series Mathematics
PY  - 2010
SP  - 33
EP  - 43
VL  - 3
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IIGUM_2010_3_4_a3/
LA  - ru
ID  - IIGUM_2010_3_4_a3
ER  -