DM
2010
13 years 4 months ago
2010
A boolean circuit represents an n by n (0,1)-matrix A if it correctly computes the linear transformation y = Ax over GF(2) on all n unit vectors. If we only allow linear boolean f...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Aim of this paper is to address the problem of learning Boolean functions from training data with missing values. We present an extension of the BRAIN algorithm, called U-BRAIN (U...
ALGORITHMICA
2010
13 years 4 months ago
2010
Abstract Winfree's pioneering work led the foundations in the area of errorreduction in algorithmic self-assembly (Winfree and Bekbolatov in DNA Based Computers 9, LNCS, vol. ...
IJCAI
1997
13 years 5 months ago
1997
This paper presents an algorithm for extract ing propositions from trained neural networks. The algorithm is a decompositional approach which can be applied to any neural networ...
ICISC
1998
13 years 5 months ago
1998
Abstract. In this paper, we introduce the concept of kth-order nonhomomorphicity of mappings or S-boxes as an alternative indicator that forecasts nonlinearity characteristics of a...
DAGSTUHL
2006
13 years 6 months ago
2006
Cryptographic Boolean functions must be complex to satisfy Shannon's principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit compl...
ICALP
2010
Springer
13 years 6 months ago
2010
Springer
We consider several questions inspired by the direct-sum problem in (two-party) communication complexity. In all questions, there are k fixed Boolean functions f1, . . . , fk and ...
EUROCRYPT
1991
Springer
13 years 8 months ago
1991
Springer
Boolean functions that satisfy higher order propagation criteria are studied. A complete characterization is given of the autocorrelation function and Walsh spectrum of second ord...
COCO
1991
Springer
13 years 8 months ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...