6142 search results - page 409 / 1229 » The Complexity of Partition Functions |
181
click to vote
ASIACRYPT
2003
Springer
16 years 9 hour ago
2003
Springer
HAVAL is a cryptographic hash function proposed in 1992 by Zheng, Pieprzyk and Seberry. Its has a structure that is quite similar to other well-known hash functions such as MD4 and...
158
click to vote
SAS
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Binary Decision Graphs are an extension of Binary Decision Diagrams that can represent some infinite boolean functions. Three refinements of BDGs corresponding to class...
213
click to vote
APNOMS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. The Next Generation Network (NGN) has a multilayer logical construction. Network carriers use various tools in complex procedures to operate application servers on the NG...
173
click to vote
WER
2000
Springer
15 years 10 months ago
2000
Springer
Distributed database design is a complex process that involves a set of distinct aspects for the accomplishment of an adequate data distribution (Buretta 1997). Many of these aspec...
181
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
We present a new variant of the quantum adversary method. All adversary methods give lower bounds on the quantum query complexity of a function by bounding the change of a progres...