Výsledky vyhľadávania - "enumeration of Boolean functions"
-
1
On the enumeration of Boolean functions with distinguished variables
ISSN: 1432-7643, 1433-7479Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2021Vydané v Soft computing (Berlin, Germany) (01.10.2021)“…Boolean functions have a fundamental role in neural networks and machine learning. Enumerating these functions and significant subclasses is a highly complex…”
Získať plný text
Journal Article -
2
Stratification and enumeration of Boolean functions by canalizing depth
ISSN: 0167-2789, 1872-8022Vydavateľské údaje: Elsevier B.V 01.01.2016Vydané v Physica. D (01.01.2016)“…Boolean network models have gained popularity in computational systems biology over the last dozen years. Many of these networks use canalizing Boolean…”
Získať plný text
Journal Article -
3
Construction and enumeration of Boolean functions with maximum algebraic immunity
ISSN: 1009-2757, 1674-733X, 1862-2836, 1869-1919Vydavateľské údaje: Beijing Science in China Press 2009Vydané v Science China. Information sciences (2009)“…Algebraic immunity is a new cryptographic criterion proposed against algebraic attacks. In order to resist algebraic attacks, Boolean functions used in many…”
Získať plný text
Journal Article -
4
On the enumeration of some inequivalent monotone Boolean functions
ISSN: 0233-1934, 1029-4945Vydavateľské údaje: Philadelphia Taylor & Francis 02.04.2024Vydané v Optimization (02.04.2024)“…This paper considers inequivalent monotone Boolean functions of an arbitrary number of variables, two monotone Boolean functions are equivalent if one can be…”
Získať plný text
Journal Article -
5
Entropy and enumeration of Boolean functions
ISSN: 0018-9448, 1557-9654Vydavateľské údaje: New York IEEE 01.09.1999Vydané v IEEE transactions on information theory (01.09.1999)“…Shannon's notion of the entropy of a random variable is used to give simplified proofs of asymptotic formulas for the logarithms of the numbers of monotone…”
Získať plný text
Journal Article -
6
Enumeration of Boolean functions of sensitivity three and inheritance of nondegeneracy
ISSN: 2157-8117Vydavateľské údaje: IEEE 01.06.2017Vydané v Proceedings / IEEE International Symposium on Information Theory (01.06.2017)“…The sensitivity of a Boolean function is the maximum, over all inputs, of the number of input bits which when flipped change the output of the function. We…”
Získať plný text
Konferenčný príspevok.. -
7
Enumeration of boolean functions with a fixed number of affine products
ISSN: 2226-308XVydavateľské údaje: 01.12.2015Vydané v Prikladnaya diskretnaya matematika. Prilozhenie (01.12.2015)Získať plný text
Journal Article -
8
Stratification and enumeration of Boolean functions by canalizing depth
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 28.04.2015Vydané v arXiv.org (28.04.2015)“…Boolean network models have gained popularity in computational systems biology over the last dozen years. Many of these networks use canalizing Boolean…”
Získať plný text
Paper -
9
On the Number of Balanced Even-Variable Boolean Functions with Maximum Algebraic Immunity
ISBN: 303785149X, 9783037851494ISSN: 1660-9336, 1662-7482, 1662-7482Vydavateľské údaje: Zurich Trans Tech Publications Ltd 01.06.2011Vydané v Applied Mechanics and Materials (01.06.2011)“…Enumeration of Boolean functions with maximum algebraic immunity (MAI) is investigated in this paper…”
Získať plný text
Journal Article -
10
Analysis of the number of even-variable boolean functions with maximum algebraic immunity
ISBN: 9781849195478, 1849195471Vydavateľské údaje: Stevenage, UK IET 2012Vydané v CIICT 2012 : Symposium on ICT and Energy Efficiency and Workshop on Information Theory and Security : 4-5 July 2012 (2012)“… In this paper, we investigate the enumeration of Boolean functions with MAI, and provide a new lower bound on the number of even-variable Boolean functions with MAI…”
Získať plný text
Konferenčný príspevok.. -
11
THE INCLUSION-EXCLUSION PRINCIPLE AND ITS APPLICATIONS TO CRYPTOGRAPHY
ISSN: 0161-1194, 1558-1586Vydavateľské údaje: Rose-Hulman Institute of Technology 01.01.1993Vydané v Cryptologia (01.01.1993)“… These problems will concentrate on the enumeration of boolean functions and permutations that have properties which are considered to be necessary for a cryptographic mapping to be secure…”
Získať plný text
Journal Article

