Sciweavers

706 search results - page 24 / 142
» On a quasi-ordering on Boolean functions
Sort
View
DDECS
2008
IEEE
185views Hardware» more  DDECS 2008»
14 years 2 months ago
Fast Boolean Minimizer for Completely Specified Functions
: We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree...
Petr Fiser, Pemysl Rucký, Irena Vanov&aacut...
APPROX
2007
Springer
153views Algorithms» more  APPROX 2007»
14 years 1 months ago
Distribution-Free Testing Lower Bounds for Basic Boolean Functions
: In the distribution-free property testing model, the distance between functions is measured with respect to an arbitrary and unknown probability distribution D over the input dom...
Dana Glasner, Rocco A. Servedio
ICCD
2003
IEEE
127views Hardware» more  ICCD 2003»
14 years 4 months ago
Structural Detection of Symmetries in Boolean Functions
Functional symmetries provide significant benefits for multiple tasks in synthesis and verification. Many applications require the manual specification of symmetries using spe...
Guoqiang Wang, Andreas Kuehlmann, Alberto L. Sangi...
SSC
2007
Springer
192views Cryptology» more  SSC 2007»
14 years 1 months ago
On Boolean Functions Which Are Bent and Negabent
Bent functions f : Fm 2 → F2 achieve largest distance to all linear functions. Equivalently, their spectrum with respect to the Hadamard-Walsh transform is flat (i.e. all spectr...
Matthew G. Parker, Alexander Pott
INDOCRYPT
2005
Springer
14 years 1 months ago
On the Algebraic Immunity of Symmetric Boolean Functions
In this paper, we analyse the algebraic immunity of symmetric Boolean functions. We identify a set of lowest degree annihilators for symmetric functions and propose an efficient al...
An Braeken, Bart Preneel