4255 search results - page 84 / 851 » On Learning Boolean Functions |
STOC
1996
ACM
15 years 2 months ago
1996
ACM
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...
DAM
2006
14 years 10 months ago
2006
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 ...
FSE
2003
Springer
15 years 3 months ago
2003
Springer
We use the notion of covering sequence, introduced by C. Carlet and Y. Tarannikov, to give a simple characterization of bent functions. We extend it into a characterization of plat...
ITA
2000
14 years 9 months ago
2000
We consider the multiparty communication model de ned in 4] using the formalism from 8]. First, we correct an inaccuracy in the proof of the fundamental result of 6] providing a lo...
ISMVL
2008
IEEE
15 years 4 months ago
2008
IEEE
Compact realizations of reversible logic functions are of interest in the design of quantum computers. In this paper we present an exact synthesis algorithm, based on Boolean Sati...