Computational bound on complexity of polynomial representations of Boolean functions (Q1943917): 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:47, 1 February 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
