%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