983 search results - page 31 / 197 » Circuit Complexity and Multiplicative Complexity of Boolean ... |
COCO
2004
Springer
14 years 1 months ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
DATE
2005
IEEE
14 years 1 months ago
2005
IEEE
We discuss fault equivalence and dominance relations for multiple output combinational circuits. The conventional definition for equivalence says that “Two faults are equivalen...
FSE
2007
Springer
14 years 1 months ago
2007
Springer
We investigate the security of n-bit to m-bit vectorial Boolean functions in stream ciphers. Such stream ciphers have higher throughput than those using single-bit output Boolean f...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
The paper proposes an extension of CFDs [1], referred to as extended Conditional Functional Dependencies (eCFDs). In contrast to CFDs, eCFDs specify patterns of semantically relate...
INFOCOM
1999
IEEE
14 years 13 hour ago
1999
IEEE
Abstract-The Internet today provides no support for privacy or authentication of multicast packets. However,an increasing number of applications will require secure multicast servi...