29908 search results - page 550 / 5982 » On the Complexity of |
214
click to vote
EUROCRYPT
2004
Springer
16 years 18 days ago
2004
Springer
We prove a tight lower bound for generic protocols for secure multicast key distribution where the messages sent by the group manager for rekeying the group are obtained by arbitra...
156
click to vote
FSTTCS
2004
Springer
16 years 18 days ago
2004
Springer
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
168
click to vote
GECCO
2004
Springer
16 years 18 days ago
2004
Springer
We analyse the probability 1 − δ to be in an optimum solution after k steps of an inhomogeneous Markov chain which is specified by a logarithmic cooling schedule c(k) = Γ/ ln ...