Article
Licensed
Unlicensed
Requires Authentication
On complexity of realisation of linear Boolean functions by circuits of functional elements over the basis {x → y, }
-
I. S. Shkrebela
Published/Copyright:
October 1, 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
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- 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
Articles in the same Issue
- 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
