%0 Journal Article
%A A. A. Voronenko
%T On the complexity of proving that a~Boolean function is not a~binary read-once
%J Prikladnaâ diskretnaâ matematika
%D 2011
%P 12-16
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2011_3_a1/
%G ru
%F PDM_2011_3_a1