26071 search results - page 413 / 5215 » Making |
318
click to vote
LCC
1994
15 years 11 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
174
click to vote
STOC
1994
ACM
15 years 11 months ago
1994
ACM
Recent work has shown many advantages to randomly wired expander-based networks. Unfortunately, the wiring complexity of such networks becomes physically problematic as they becom...
215
click to vote
STACS
1992
Springer
15 years 11 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
148
click to vote
TPHOL
1992
IEEE
15 years 11 months ago
1992
IEEE
The HOL system is an LCF-style mechanized proof-assistant for conducting proofs in higher order logic. This paper discusses a proposal to extend the primitive basis of the logic un...
168
click to vote
ASIACRYPT
2007
Springer
15 years 11 months ago
2007
Springer
A shuffle is a permutation and re-encryption of a set of ciphertexts. Shuffles are for instance used in mix-nets for anonymous broadcast and voting. One way to make a shuffle verif...