On complexity of a particular Boolean functions class (Q1943910)
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 a particular Boolean functions class |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On complexity of a particular Boolean functions class |
scientific article |
Statements
On complexity of a particular Boolean functions class (English)
0 references
3 April 2013
0 references
Boolean function
0 references
exor-sum-of-products
0 references
polynomial
0 references
operator
0 references
complexity
0 references