Поиск

Автор

Ключевое слово

Тип статьи

DOI

ORCID

Дополнительно:

Период публикации

Репозиторий

По вашему запросу найдено документов: 6447

Страница 2 из 645

set of multifunctions on f0; 1g which contains all unary Boolean functions with respect to given

, i.e., collections of subsets generalizing Boolean algebras and closed under the symmetric difference

of the main result: descriptions of the minimal algebras of unary multioperations of a finite rank. As a

A method for bi-decomposition of incompletely speciﬁed (partial) Boolean functions is suggested

It is known that if we have set of test pairs of neighbor Boolean vectors for robust testable PDF

along with minimizing the number of memory elements and minimization of their switching activity

of one of the three circuits may be undetected. It is desirable to minimize this area. In this paper

is assigned with a set of arguments of the given function. According to each of bicliques, a Boolean function

for incompatible classes of Boolean tables from fragments of identical width depending on the following parameters

It is shown the usage of binary counter as test generator for programmable boolean matrix permits

Страница 2 из 645