|
This article is cited in 6 scientific papers (total in 6 papers)
Realization of Boolean functions by nonrepetitive formulas
N. A. Peryazev
Abstract:
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.
Received: 27.10.1992 Revised: 20.12.1993
Citation:
N. A. Peryazev, “Realization of Boolean functions by nonrepetitive formulas”, Diskr. Mat., 7:3 (1995), 61–68; Discrete Math. Appl., 5:4 (1995), 347–355
Linking options:
https://www.mathnet.ru/eng/dm588 https://www.mathnet.ru/eng/dm/v7/i3/p61
|
Statistics & downloads: |
Abstract page: | 579 | Full-text PDF : | 414 | First page: | 4 |
|