A lower estimate of the complexity of three-valued logic functions in the class of polarized polynomials (Q1759162): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / 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: On the complexity of polarised polynomials of multi-valued logic functions in one variable / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graphs of Linear Forms on Modules over Boolean Rings / rank | |||
Normal rank | |||
Latest revision as of 22:21, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower estimate of the complexity of three-valued logic functions in the class of polarized polynomials |
scientific article |
Statements
A lower estimate of the complexity of three-valued logic functions in the class of polarized polynomials (English)
0 references
20 November 2012
0 references
three-valued function
0 references
polynomial
0 references
polarized polynomial
0 references
complexity
0 references
Shannon function
0 references
