On Irreduceability of Boolean Functions with Respect to Commutative Associative Operationстатья
Информация о цитировании статьи получена из
Web of Science,
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 9 апреля 2021 г.
Аннотация:The paper is focused on decomposition of Boolean functions in the form f1◦...◦fm, where ◦ is a commutative associative operation and f1,...,fm are Boolean functions with fewer arguments. For each commutative associative operation, we determine the necessary and sufficient conditions of the absence of such a decomposition and find the related complexity class.