63 search results - page 3 / 13 » Boolean Functions for Finite-Tree Dependencies |
INDOCRYPT
2005
Springer
14 years 29 days ago
2005
Springer
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...
FCT
2001
Springer
13 years 12 months ago
2001
Springer
In this paper dense families of database relations are introduced. We characterize dependencies and keys of relation instances in terms of dense families. Key functions are also in...
ACSD
2005
IEEE
14 years 1 months ago
2005
IEEE
Perfectly synchronous systems immediately react to the inputs of their environment, which may lead to so-called causality cycles between actions and their trigger conditions. Algo...
STOC
2003
ACM
14 years 7 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...
ICCAD
1999
IEEE
13 years 11 months 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...