TY - JOUR AU - S. N. Selezneva TI - On the complexity of recognizing the completeness of sets of Boolean functions realized by Zhegalkin polynomials JO - Diskretnaya Matematika PY - 1997 SP - 24 EP - 31 VL - 9 IS - 4 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DM_1997_9_4_a2/ LA - ru ID - DM_1997_9_4_a2 ER -