3208 search results - page 325 / 642 » A Lower Bound for Primality |
137
click to vote
WG
1992
Springer
15 years 10 months ago
1992
Springer
The recognition complexityof ordered set properties is considered, i.e.how many questions have to be asked to decide if an unknown ordered set has a prescribed property. We prove ...
161
click to vote
INFOCOM
1990
IEEE
15 years 10 months ago
1990
IEEE
This paper analyzes the fault tolerance of a class of double-loop networks referred to as forwardloop backward-hop FLBH, in which each node is connected via unidirectional links t...
198
click to vote
COCOON
2004
Springer
15 years 10 months ago
2004
Springer
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
173
click to vote
FSE
2006
Springer
15 years 10 months ago
2006
Springer
We propose a general framework for differential and linear cryptanalysis of block ciphers when the block is not a bitstring. We prove piling-up lemmas for the generalized different...
151
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
We introduce a generic type system (based on Milner's sort system) for the synchronous polyadic -calculus, allowing us to mechanise the analysis of input/output capabilities o...