Boolean functionsA C 0Attribute noiseClassification noiseWe study a procedure for estimating an upper bound of an unknown noise factor in the frequency domain. A learning algorithm using a Fourier transformation method was originally given by Linial, Mansour and Nisan. While Linial, Mansour and ...
In order to ensure this security, many approa... J Dong,D Pei,X Wang - Springer Berlin Heidelberg 被引量: 53发表: 2007年 On formal verification of arithmetic-based cryptographic primitives Cryptographic primitives are fundamental for information security: they are used as basic components for ...
With cryptographic investigations, the design of Boolean functions is a wide area. The Boolean functions play important role in the construction of a symmetric cryptosystem. In this paper the modified hill climbing method is considered. The method allows using hill climbing techniques to modify bent ...
This paper presents a theoretical model for learning Boolean functions in domains having a large, potentially infinite number of attributes. The model allows an algorithm to employ a rich vocabulary to describe the objects it encounters in the world without necessarily incurring time and space penaltie...
Motivation In contextImpl.java the getConsumer() - When trying to get partitioned topic consumer it throws error consumer not found. Instead show error message that partitioned topic not present. A...
摘要: Based on a classification of invariants, we show how to efficiently classify Boolean functions in 6 and 7 variables of degree 3. The sizes of the orbits for every class is determined in the same time.被引量: 10 年份: 2005
The functionboolcreturns a single-character character string of the typestring. If the logical expression is true, "X" is returned. If the logical expression is false, a blank is returned. In principle,boolcis one of theprocessing functions with character-like resultsand can be specified ingen...
The number of Boolean functions computed by formulas of a given size. Estimates are given of the number B(n; L) of distinct functions computed by propositional formulas of size L in n variables, constructed using only literal... P Savický,AR Woods - 《Random Structures & Algorithms》 被...
摘要: This paper describes a common mathematical framework for the design of additive and non-additive Quantum Error Correcting Codes. It is based on a correspondence between boolean functions and projection operators. The new framework extends to operator quantum error correcting codes....
In contrast, the best known algorithm for computing an exact isomorphism between n -ary Boolean functions has running time 2 O ( n ) [9] even for functions computed by poly( n ) size DNF formulas. Our algorithm is based on a result for hypergraph isomorphism with bounded edge size [3]...