Geodesic
The representability of a Boolean function by a repetition-free formula can be verified by a circuit of linear complexity
Diskretnaya Matematika, Tome 17 (2005) no. 4, pp. 111-115

Voir la notice de l'article provenant de la source Math-Net.Ru

We prove that the representability of a Boolean function by a repetition-free formula can be verified by a circuit of linear complexity. This research was supported by the Russian Foundation for Basic Research, grant 04–01–00359. 
@article{DM_2005_17_4_a10,
     author = {A. A. Voronenko},
     title = {The representability of a {Boolean} function by a repetition-free formula can be verified by a circuit of linear complexity},
     journal = {Diskretnaya Matematika},
     pages = {111--115},
     publisher = {mathdoc},
     volume = {17},
     number = {4},
     year = {2005},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2005_17_4_a10/}
}
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  - 
%0 Journal Article
%A A. A. Voronenko
%T The representability of a Boolean function by a repetition-free formula can be verified by a circuit of linear complexity
%J Diskretnaya Matematika
%D 2005
%P 111-115
%V 17
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2005_17_4_a10/
%G ru
%F DM_2005_17_4_a10
A. A. Voronenko. The representability of a Boolean function by a repetition-free formula can be verified by a circuit of linear complexity. Diskretnaya Matematika, Tome 17 (2005) no. 4, pp. 111-115. http://geodesic.mathdoc.fr/item/DM_2005_17_4_a10/