Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
On the comparison of complexity of two ways of realization of some linear Boolean functions
-
K. A. ZYKOV
Veröffentlicht/Copyright:
9. Oktober 2009
Published Online: 2009-10-09
Published in Print: 1996
Walter de Gruyter
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- The number of readings of non-equiprobable files under stable sorting
- Unsolvability of vector discrete optimization problems in the class of algorithms of linear convolution of criteria
- Search problems on graphs of regular polyhedra
- Checking tests for superpositions of Boolean functions of elementary homogeneous functions
- On the complexity of restrictions of Boolean functions
- On the comparison of complexity of two ways of realization of some linear Boolean functions
- The structure of Information distribution in infinite sequences
- Singularity of some relations and their combinatorial applications
Artikel in diesem Heft
- The number of readings of non-equiprobable files under stable sorting
- Unsolvability of vector discrete optimization problems in the class of algorithms of linear convolution of criteria
- Search problems on graphs of regular polyhedra
- Checking tests for superpositions of Boolean functions of elementary homogeneous functions
- On the complexity of restrictions of Boolean functions
- On the comparison of complexity of two ways of realization of some linear Boolean functions
- The structure of Information distribution in infinite sequences
- Singularity of some relations and their combinatorial applications
