Complexity lower bound for Boolean functions in the class of extended operator forms (Q2306843): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Lower bounds of complexity for polarized polynomials over finite fields / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4382830 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity of Boolean functions' representations in classes of extended pair-generated operator forms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2748260 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A lower estimate of the complexity of three-valued logic functions in the class of polarized polynomials / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity of Boolean functions in the class of polarized polynomial forms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Upper bound for the length of functions over a finite field in the class of pseudopolynomials / rank | |||
Normal rank | |||
Latest revision as of 04:30, 22 July 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
0 references
0 references
