|
ИСТИНА |
Войти в систему Регистрация |
ФНКЦ РР |
||
On the network complexity of systems of Boolean functions, corresponding to some cyclic matrixesстатья
- Автор: Zykov K.A.
- Сборник: Proceedings of two joint French-Russian seminars on combinatorial and algorithmical properties of discrete structure (April 1998, Moscow --- February 1999, Nansy, France). Project No 8/97
- Год издания: 2001
- Место издания: French-Russian A. M. Liapunov Institute Moscow
- Первая страница: 57
- Последняя страница: 60
- Аннотация: In the present paper we consider arbitrary systems of functions such that the structure of essential variables is set by special cyclic Boolean matrixes. The linear lower bound of complexity of a realization of such systems by the networks over the basis of two-input elements is obtained. It is shown, that in a series of cases this bound is sharp for systems consisting of linear Boolean functions.
- Добавил в систему: Зыков Константин Анатольевич