628 search results - page 9 / 126 » Magic Counting Methods |
139
click to vote
CANS
2008
Springer
15 years 8 months ago
2008
Springer
In the Crypto'07 paper [5], Desmedt et al. studied the problem of achieving secure n-party computation over nonAbelian groups. The function to be computed is fG(x1, . . . , x...
165
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
169
click to vote
WG
2004
Springer
15 years 11 months ago
2004
Springer
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...