Diskretnaya Matematika, Tome 7 (1995) no. 3, pp. 61-68
Citer cet article
N. A. Peryazev. Realization of Boolean functions by nonrepetitive formulas. Diskretnaya Matematika, Tome 7 (1995) no. 3, pp. 61-68. http://geodesic.mathdoc.fr/item/DM_1995_7_3_a5/
@article{DM_1995_7_3_a5,
author = {N. A. Peryazev},
title = {Realization of {Boolean} functions by nonrepetitive formulas},
journal = {Diskretnaya Matematika},
pages = {61--68},
year = {1995},
volume = {7},
number = {3},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DM_1995_7_3_a5/}
}
TY - JOUR
AU - N. A. Peryazev
TI - Realization of Boolean functions by nonrepetitive formulas
JO - Diskretnaya Matematika
PY - 1995
SP - 61
EP - 68
VL - 7
IS - 3
UR - http://geodesic.mathdoc.fr/item/DM_1995_7_3_a5/
LA - ru
ID - DM_1995_7_3_a5
ER -
%0 Journal Article
%A N. A. Peryazev
%T Realization of Boolean functions by nonrepetitive formulas
%J Diskretnaya Matematika
%D 1995
%P 61-68
%V 7
%N 3
%U http://geodesic.mathdoc.fr/item/DM_1995_7_3_a5/
%G ru
%F DM_1995_7_3_a5
We give a characterization of Boolean functions realized by formulae without repetitions in the basis $\{\cdot ,\lor, \oplus ,\bar{\space}\, \}$ and suggest an algorithm for finding such realizations.
