TY  - JOUR
AU  - A. A. Voronenko
TI  - On the complexity of proving that a~Boolean function is not a~binary read-once
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2011
SP  - 12
EP  - 16
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2011_3_a1/
LA  - ru
ID  - PDM_2011_3_a1
ER  -