707 search results - page 21 / 142 » The Nonhomomorphicity of Boolean Functions |
ICCAD
1999
IEEE
14 years 6 days ago
1999
IEEE
Algorithmic logic synthesis is usually carried out in two stages, the independent stage where logic minimization is performed on the Boolean equations with no regard to physical p...
DSD
2003
IEEE
14 years 1 months ago
2003
IEEE
We present a novel heuristic algorithm for two-level Boolean minimization. In contrast to the other approaches, the proposed method firstly finds the coverage of the on-sets and f...
VLSID
2002
IEEE
14 years 24 days ago
2002
IEEE
A new approach to synthesizing totally symmetric Boolean functions is presented. First, a novel cellular array is introduced for synthesizing unate symmetric functions. Using this...
ACISP
2006
Springer
14 years 1 months ago
2006
Springer
In this paper we are interested in algebraic immunity of several well known highly-nonlinear vectorial Boolean functions (or Sboxes), designed for block and stream ciphers. Unfortu...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...