On complexity of a particular Boolean functions class (Q1943910): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 15:47, 1 February 2024
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