On the complexity of representation of k-valued functions by generalised polarised polynomials (Q3225903): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| 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: An upper bound for complexity of polynomial normal forms of Boolean functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complexity of generalized polynomials of \(k\)-valued functions / 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 | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:17, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of representation of k-valued functions by generalised polarised polynomials |
scientific article |
Statements
On the complexity of representation of k-valued functions by generalised polarised polynomials (English)
0 references
23 March 2012
0 references
\(k\)-valued logic functions
0 references
generalised polarised polynomials
0 references
Shannon functions
0 references
