Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
On complexity of realisation of linear Boolean functions by circuits of functional elements over the basis {x → y, }
-
I. S. Shkrebela
Veröffentlicht/Copyright:
1. Oktober 2003
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.
Published Online: 2003-10-01
Published in Print: 2003-10-01
Copyright 2003, Walter de Gruyter
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Collectives of automata in labyrinths
- On the complexity of the string generation problem
- On complexity of realisation of linear Boolean functions by circuits of functional elements over the basis {x → y, }
- On special properties of a composition of automata
- Limit distributions of the number of cycles of given length in a random permutation with given number of cycles
- Emergence of a giant component in a random permutation with given number of cycles
Artikel in diesem Heft
- Collectives of automata in labyrinths
- On the complexity of the string generation problem
- On complexity of realisation of linear Boolean functions by circuits of functional elements over the basis {x → y, }
- On special properties of a composition of automata
- Limit distributions of the number of cycles of given length in a random permutation with given number of cycles
- Emergence of a giant component in a random permutation with given number of cycles
