983 search results - page 47 / 197 » Circuit Complexity and Multiplicative Complexity of Boolean ... |
ISCAS
2002
IEEE
14 years 3 months ago
2002
IEEE
In this paper, an analog implementation of the Wavelet Transform (WT) is presented. The circuit is based on the Dynamic Translinear (DTL) circuit technique and implements, by mean...
FOCS
1998
IEEE
14 years 2 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 ...
COCO
2005
Springer
14 years 3 months ago
2005
Springer
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
ECAL
2003
Springer
14 years 3 months ago
2003
Springer
Abstract Wherever we see life, we see different kinds of complex networks, reason why they are studied across various fields of science. Random Boolean Networks (RBNs) form a spe...
DAGSTUHL
2006
13 years 11 months ago
2006
This paper presents the optimal compression for sequences with undefined values. Let we have (N -m) undefined and m defined positions in the boolean sequence V of length N. The se...