Поиск

Автор

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

Тип статьи

DOI

ORCID

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

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

Репозиторий

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

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

We find a polynomial algorithm to solve SAT problem in Boolean Logic

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

on the base of bijective systems of Boolean functions. The description is illustrated with a simple example

In this article we study Boolean functions with two kinds of indeterminacy. We prove criterion

The problem of series two-block decomposition of completely specified Boolean functions

-block parallel decomposition of a system of partial Boolean functions represented by a pair of ternary matrices

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

of the quantum hashing technique. In particular we apply it for computing Boolean functions in the model of read

Functional expansions of system of boolean functions

The issues of using augmented reality when studying a course of Boolean algebra are considered

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