On complexity of computation of partial derivatives of Boolean functions realized by Zhegalkin polynomials (Q1407293): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q333552 |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / author | |||
| Property / author: A. N. Alekseychuk / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 03:15, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On complexity of computation of partial derivatives of Boolean functions realized by Zhegalkin polynomials |
scientific article |
Statements
On complexity of computation of partial derivatives of Boolean functions realized by Zhegalkin polynomials (English)
0 references
16 September 2003
0 references
Boolean functions
0 references
polynomial expansions of Boolean functions
0 references
Zhegalkin polynomials
0 references
values of partial derivatives of Boolean functions
0 references
combinational complexity of partial derivatives
0 references
optimal computation of partial derivatives
0 references
