On the enumeration of Boolean functions with distinguished variables
Rights accessOpen Access
ProjectJUEGOS DE VOTACION Y COOPERACION CON APLICACIONES A LAS REDES SOCIALES Y A LAS CIENCIAS POLITICAS (AEI-PID2019-104987GB-I00)
Boolean functions have a fundamental role in neural networks and machine learning. Enumerating these functions and significant subclasses is a highly complex problem. Therefore, it is of interest to study subclasses that escape this limitation and can be enumerated by means of sequences depending on the number of variables. In this article, we obtain seven new formulas corresponding to enumerations of some subclasses of Boolean functions. The versatility of these functions does the problem interesting to several different fields as game theory, hypergraphs, reliability, cryptography or logic gates.
This is a post-peer-review, pre-copyedit version of an article published in Soft computing. The final authenticated version is available online at: http://dx.doi.org/10.1007/s00500-020-05422-5
CitationFreixas, J. On the enumeration of Boolean functions with distinguished variables. "Soft computing", 18 Novembre 2020, v. 25, n. 19, p. 12627-12640.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder