Finding the subsets of variables of a partial Boolean function which are sufficient for its implementation in the classes defined by predicates
Given a class K of partial Boolean functions and a partial Boolean function f of n variables, a subset U of its variables is called sufficient for the implementation of f in K if there exists an extension of f in K with arguments in U. We consider the problem of recognizing all subsets sufficient fo...
Published in: | Journal of applied and industrial mathematics Vol. 14, № 1. P. 186-195 |
---|---|
Main Author: | |
Format: | Article |
Language: | English |
Subjects: | |
Online Access: | http://vital.lib.tsu.ru/vital/access/manager/Repository/vtls:000795566 Перейти в каталог НБ ТГУ |