Complexity lower bound for Boolean functions in the class of extended operator forms (Q2306843): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: OEIS / rank | |||
Normal rank | |||
Revision as of 08:24, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity lower bound for Boolean functions in the class of extended operator forms |
scientific article |
Statements
Complexity lower bound for Boolean functions in the class of extended operator forms (English)
0 references
26 March 2020
0 references
Boolean function
0 references
lower bound
0 references
extension of finite field
0 references
Mersenne prime
0 references
