On complexity of computation of partial derivatives of Boolean functions realized by Zhegalkin polynomials

DOI10.1023/A:1013898304645zbMath1024.06007MaRDI QIDQ1407293

A. N. Alekseychuk

Publication date: 16 September 2003

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

Boolean functionsZhegalkin polynomialscombinational complexity of partial derivativesoptimal computation of partial derivativespolynomial expansions of Boolean functionsvalues of partial derivatives of Boolean functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Boolean functions (06E30)

Related Items (1)

Communication Lower Bounds Using Directional Derivatives

This page was built for publication: On complexity of computation of partial derivatives of Boolean functions realized by Zhegalkin polynomials