TY  - JOUR
AU  - A. A. Voronenko
TI  - The representability of a Boolean function by a repetition-free formula can be verified by a circuit of linear complexity
JO  - Diskretnaya Matematika
PY  - 2005
SP  - 111
EP  - 115
VL  - 17
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2005_17_4_a10/
LA  - ru
ID  - DM_2005_17_4_a10
ER  -