An upper bound for complexity of polynomial normal forms of Boolean functions (Q5704311)
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: An upper bound for complexity of polynomial normal forms of Boolean functions |
scientific article; zbMATH DE number 2228535
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound for complexity of polynomial normal forms of Boolean functions |
scientific article; zbMATH DE number 2228535 |
Statements
An upper bound for complexity of polynomial normal forms of Boolean functions (English)
0 references
14 November 2005
0 references
covering problem
0 references
