On the complexity of polarised polynomials of multi-valued logic functions in one variable
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 378896784 | ||
| 003 | CHVBK | ||
| 005 | 20180305123508.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 161128e20040701xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1515/1569392031905539 |2 doi |
| 035 | |a (NATIONALLICENCE)gruyter-10.1515/1569392031905539 | ||
| 100 | 1 | |a Selezneva |D S. N. | |
| 245 | 1 | 0 | |a On the complexity of polarised polynomials of multi-valued logic functions in one variable |h [Elektronische Daten] |c [S. N. Selezneva] |
| 520 | 3 | |a We consider multi-valued logic functions represented by polarised polynomials. A polynomial is called polarised if each its variable can be polarised by a certain shift. We introduce the Shannon function which characterises the complexity of representations of multi-valued logic functions by polarised polynomials and obtain an exact estimate of the Shannon function for functions in one variable. | |
| 540 | |a Copyright 2004, Walter de Gruyter | ||
| 773 | 0 | |t Discrete Mathematics and Applications |d Walter de Gruyter |g 14/3(2004-07-01), 263-266 |x 0924-9265 |q 14:3<263 |1 2004 |2 14 |o dma | |
| 856 | 4 | 0 | |u https://doi.org/10.1515/1569392031905539 |q text/html |z Onlinezugriff via DOI |
| 908 | |D 1 |a research article |2 jats | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1515/1569392031905539 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 100 |E 1- |a Selezneva |D S. N. | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Discrete Mathematics and Applications |d Walter de Gruyter |g 14/3(2004-07-01), 263-266 |x 0924-9265 |q 14:3<263 |1 2004 |2 14 |o dma | ||
| 900 | 7 | |b CC0 |u http://creativecommons.org/publicdomain/zero/1.0 |2 nationallicence | |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-gruyter | ||