On complexity of computation of partial derivatives of Boolean functions realized by Zhegalkin polynomials (Q1407293)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On complexity of computation of partial derivatives of Boolean functions realized by Zhegalkin polynomials |
scientific article; zbMATH DE number 1981947
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On complexity of computation of partial derivatives of Boolean functions realized by Zhegalkin polynomials |
scientific article; zbMATH DE number 1981947 |
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
0.8204087018966675
0 references
0.8199799656867981
0 references
0.8084691166877747
0 references
0.8057974576950073
0 references
