178 search results - page 21 / 36 » Boolean Algebras in Visser Algebras |
105
click to vote
ICCD
1996
IEEE
15 years 1 months ago
1996
IEEE
The Multi-Level Decomposition Diagrams (MLDDs) of this paper are a canonical representation of Boolean functions expliciting disjoint-support decompositions. MLDDs allow the reduc...
CRYPTO
2000
Springer
15 years 2 months ago
2000
Springer
In this paper we investigate the relationship between the nonlinearity and the order of resiliency of a Boolean function. We first prove a sharper version of McEliece theorem for ...
DATESO
2004
14 years 11 months ago
2004
Binary Factor Analysis (BFA, also known as Boolean Factor Analysis) may help with understanding collections of binary data. Since we can take collections of text documents as binar...
102
click to vote
AMAST
1991
Springer
15 years 1 months ago
1991
Springer
Boolean logic treats disjunction and conjunction symmetrically and algebraically. The corresponding operations for computation are respectively nondeterminism (choice) and concurr...
CANS
2009
Springer
15 years 4 months ago
2009
Springer
At Crypto 2008, Shamir introduced a new algebraic attack called the cube attack, which allows us to solve black-box polynomials if we are able to tweak the inputs by varying an ini...