706 search results - page 59 / 142 » On a quasi-ordering on Boolean functions |
EUROCRYPT
2003
Springer
14 years 2 months ago
2003
Springer
A classical construction of stream ciphers is to combine several LFSRs and a highly non-linear Boolean function f. Their security is usually analysed in terms of correlation attack...
ESOP
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. We propose a new representation for the domain of Definite Boolean functions. The key idea is to view the set of models of a Boolean function as an incidence relation be...
COLT
2008
Springer
13 years 10 months ago
2008
Springer
A kernel over the Boolean domain is said to be reflection-invariant, if its value does not change when we flip the same bit in both arguments. (Many popular kernels have this prop...
ALGORITHMICA
2010
13 years 9 months ago
2010
Abstract Winfree's pioneering work led the foundations in the area of errorreduction in algorithmic self-assembly (Winfree and Bekbolatov in DNA Based Computers 9, LNCS, vol. ...
DAC
2003
ACM
14 years 10 months ago
2003
ACM
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...