|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ИНХС РАН |
||
The Complexity of the Standard Multiplexer Function in a Class of Switching Circuitsстатья Перевод
- Авторы: Lozhkin S.A., Khzmalyan D.E.
- Журнал: Journal Computational Mathematics and Modeling
- Том: 32
- Номер: 4
- Год издания: 2021
- Первая страница: 478
- Последняя страница: 489
- DOI: 10.1007/s10598-022-09547-0
- Аннотация: The article considers the synthesis of switching circuits that realize standard multiplexer Boolean functions of order n, i.e., Boolean multiplexer functions with n select lines and 2^n data variables. A lower bound is derived on the complexity of realization of these Boolean functions in the class of so-called correct switching circuits, which is close to the known upper bound on their complexity in the class of arbitrary switching circuits.
- Добавил в систему: Ложкин Сергей Андреевич