Computational bound on complexity of polynomial representations of Boolean functions (Q1943917): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 05:19, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational bound on complexity of polynomial representations of Boolean functions |
scientific article |
Statements
Computational bound on complexity of polynomial representations of Boolean functions (English)
0 references
3 April 2013
0 references
Boolean functions
0 references
exclusive-or-sum-of-products
0 references
minimization
0 references
genetic algorithms
0 references
