On complexity of computation of partial derivatives of Boolean functions realized by Zhegalkin polynomials (Q1407293): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:19, 31 January 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
