707 search results - page 121 / 142 » The Nonhomomorphicity of Boolean Functions |
IACR
2011
13 years 9 months ago
2011
This paper presents a method for constructing n-stage Galois NLFSRs with period 2n − 1 from n-stage maximum length LFSRs. We introduce nonlinearity into state cycles by adding a ...
79
Voted
DLOG
2008
15 years 18 hour ago
2008
A fundamental requirement for cooperating agents is to agree on a selection of component values of objects that can be used for reliably communicating references to the objects, to...
102
click to vote
JCSS
2008
14 years 9 months ago
2008
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
66
Voted
DAC
1994
ACM
15 years 1 months ago
1994
ACM
- This paper describes a symbolic formulation that allows incorporation of speculative operation execution (preexecution) in an exact control-dependent scheduling of arbitrary forw...
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
We present an efficient reduction mapping undirected graphs G with n = 2k vertices for integers k to tables of partially specified Boolean functions g : {0, 1}4k+1 {0, 1, } so tha...