On the complexity of completeness recognition of systems of Boolean functions realized in the form of Zhegalkin polynomials

Светлана Николаевна Селезнева · Discrete Mathematics and Applications · 1997

Article On the complexity of completeness recognition of systems of Boolean functions realized in the form of Zhegalkin polynomials was published on January 1, 1997 in the journal Discrete Mathematics and Applications (volume 7, issue 6).

Read the paper · More papers on PaperTik