Lower bound for the complexity of five-valued polarized polynomials (Q1744288): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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: On complexity of representation of multiple-valued logic functions as polarised polynomials / 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: Upper bounds of the complexity of functions over finite fields in some classes of Kronecker forms / rank | |||
Normal rank | |||
Latest revision as of 12:47, 15 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bound for the complexity of five-valued polarized polynomials |
scientific article |
Statements
Lower bound for the complexity of five-valued polarized polynomials (English)
0 references
23 April 2018
0 references
five-valued functions
0 references
polarized polynomial
0 references
Kronecker form
0 references
complexity lower bounds
0 references
0 references
0 references
