Sciweavers

707 search results - page 85 / 142
» The Nonhomomorphicity of Boolean Functions
Sort
View
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
15 years 1 months ago
Characterizing Linear Size Circuits in Terms of Privacy
In this paper we prove a perhaps unexpected relationship between the complexity class of the boolean functions that have linear size circuits, and n-party private protocols. Speci...
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosé...
DAM
2006
88views more  DAM 2006»
14 years 9 months ago
Finding nonnormal bent functions
The question if there exist nonnormal bent functions was an open question for several years. A Boolean function in n variables is called normal if there exists an affine subspace ...
Anne Canteaut, Magnus Daum, Hans Dobbertin, Gregor...
DM
2008
110views more  DM 2008»
14 years 10 months ago
A novel algorithm enumerating bent functions
By the relationship between the Walsh spectra at partial points and the Walsh spectra of its sub-functions, by the action of general linear group on the set of Boolean functions, ...
Qingshu Meng, Min Yang, Huanguo Zhang, Jingsong Cu...
AML
2010
118views more  AML 2010»
14 years 10 months ago
The modal logic of continuous functions on the rational numbers
Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'. We ext...
Philip Kremer
AML
2006
87views more  AML 2006»
14 years 10 months ago
The modal logic of continuous functions on cantor space
Abstract Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'...
Philip Kremer