707 search results - page 9 / 142 » The Nonhomomorphicity of Boolean Functions |
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
A set of Boolean functions is called a bent set if the sum of any two distinct members is a bent function. We show that any bent set yields a homogeneous system of linked symmetric...
FSE
2004
Springer
14 years 1 months ago
2004
Springer
In this paper we study the minimum distance between the set of bent functions and the set of 1-resilient Boolean functions and present a lower bound on that. The bound is proved to...
ICCAD
2010
IEEE
13 years 5 months ago
2010
IEEE
Boolean matching for multiple-output functions determines whether two given (in)completely-specified function vectors can be identical to each other under permutation and/or negat...
TCAD
2002
13 years 7 months ago
2002
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuits...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
We analyze skewing, an approach that has been empirically observed to enable greedy decision tree learners to learn "difficult" Boolean functions, such as parity, in the...