On complexity of realisation of linear Boolean functions by circuits of functional elements over the basis {x → y, }
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 378882562 | ||
| 003 | CHVBK | ||
| 005 | 20180305123435.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 161128e20031001xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1515/156939203322694754 |2 doi |
| 035 | |a (NATIONALLICENCE)gruyter-10.1515/156939203322694754 | ||
| 100 | 1 | |a Shkrebela |D I. S. | |
| 245 | 1 | 0 | |a On complexity of realisation of linear Boolean functions by circuits of functional elements over the basis {x → y, } |h [Elektronische Daten] |c [I. S. Shkrebela] |
| 520 | 3 | |a We show that the minimal circuit of functional elements over the basis {x → y, } which realises a linear function of n variables consists of 4n - 4 elements. | |
| 540 | |a Copyright 2003, Walter de Gruyter | ||
| 773 | 0 | |t Discrete Mathematics and Applications |d Walter de Gruyter |g 13/5(2003-10-01), 483-496 |x 0924-9265 |q 13:5<483 |1 2003 |2 13 |o dma | |
| 856 | 4 | 0 | |u https://doi.org/10.1515/156939203322694754 |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/156939203322694754 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 100 |E 1- |a Shkrebela |D I. S. | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Discrete Mathematics and Applications |d Walter de Gruyter |g 13/5(2003-10-01), 483-496 |x 0924-9265 |q 13:5<483 |1 2003 |2 13 |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 | ||