On Complexity of Computation of Partial Derivatives of Boolean Functions Realized by Zhegalkin Polynomials

Authors:
A. N. Alekseichuk
Affiliations:
Military Institute of Information and Telecommunications of NTUU "Kiev Polytechnical Institute," Kiev, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2001

Citing 3
Cited 0

Partition of symmetrical boolean functions into canonically polarized polynomials

Journal of Information Processing and Cybernetics
On the Complexity of Mod-2l Sum PLA's

IEEE Transactions on Computers
Combinatorial Algorithms: Theory and Practice

Combinatorial Algorithms: Theory and Practice

Quantified Score

Hi-index	0.00

Visualization

Abstract

The combinational complexity of a system of partial derivatives in the basis of linear functions is established for a Boolean function of in variables that is realized by a Zhegalkin polynomial. An algorithm whose complexity equals 3^n - 2^n modulo 2 additions is proposed for computation of all partial derivatives of such a function from the coefficients of its Zhegalkin polynomial.