|
Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2011, Number 11, Pages 72–77
(Mi ivm8396)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Brief communications
Iterated Boolean functions in the elementary basis
A. A. Voronenko, V. S. Fedorova, D. V. Chistikov Chair of Mathematical Cybernetics, Moscow State University, Moscow, Russia
Abstract:
We establish a new criterion for a Boolean function to be read-once over the basis of conjunction, disjunction, and negation. We prove that each Boolean function is either read-once or has a set of four or six input vectors such that values of this function on these vectors show that it is iterated. We use this criterion to deduce an alternative proof of the known Stetsenko criterion.
Keywords:
read-once Boolean function, criterion.
Citation:
A. A. Voronenko, V. S. Fedorova, D. V. Chistikov, “Iterated Boolean functions in the elementary basis”, Izv. Vyssh. Uchebn. Zaved. Mat., 2011, no. 11, 72–77; Russian Math. (Iz. VUZ), 55:11 (2011), 61–65
Linking options:
https://www.mathnet.ru/eng/ivm8396 https://www.mathnet.ru/eng/ivm/y2011/i11/p72
|
Statistics & downloads: |
Abstract page: | 362 | Full-text PDF : | 152 | References: | 57 | First page: | 9 |
|