706 search results - page 66 / 142 » On a quasi-ordering on Boolean functions |
162
click to vote
ADCM
2007
15 years 6 months ago
2007
We present a new method for reconstructing the density function underlying a given histogram. First we analyze the univariate case taking the approximating function in a class of q...
160
click to vote
ETFA
2006
IEEE
16 years 11 days ago
2006
IEEE
This paper presents a new approach to modelling and verification of function block applications of the IEC 61499 standard. The approach uses the language of logic programming Prol...
191
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
163
click to vote
STOC
1996
ACM
15 years 10 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...
136
click to vote
DAM
2006
15 years 6 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 ...