707 search results - page 68 / 142 » The Nonhomomorphicity of Boolean Functions |
FFA
2008
13 years 8 months ago
2008
We study the Boolean functions f :F2n F2, n = 6r, of the form f (x) = Tr(xd) with d = 22r + 2r + 1 and F2n . Our main result is the characterization of those for which f are b...
IACR
2011
12 years 7 months ago
2011
We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning problems. Our constructions are asymptotically effici...
DAC
1994
ACM
14 years 4 days ago
1994
ACM
-- In this paper we present a new method for Boolean matching of completely specified Boolean functions. The canonical Generalized Reed-Muller forms are used as a powerful analysis...
SAS
1999
Springer
14 years 8 days ago
1999
Springer
Abstract. Binary Decision Graphs are an extension of Binary Decision Diagrams that can represent some infinite boolean functions. Three refinements of BDGs corresponding to class...
ICLP
2011
Springer
12 years 11 months ago
2011
Springer
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...