On the Shannon function for read-many certificate length in one base family
A. A. Voronenko · Moscow University Computational Mathematics and Cybernetics · 2013
The following problem is considered: Find a tuple of rows (certificates) that can be used to check if a function of n variables is read-many in some basis B . This study uses a linear order of the Shannon function of the certificate length for all functions of n variables in a basis consisting of conjunction, disjunction, negation, and discriminator of s variables.