363 search results - page 42 / 73 » Code Generation for Polynomial Multiplication |
CRYPTO
2003
Springer
15 years 5 months ago
2003
Springer
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic t...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract-- This paper considers the problem of transferring a file from one source node to multiple receivers in a peer-to-peer (P2P) network. The objective is to minimize the weig...
81
Voted
IEEECIT
2010
IEEE
14 years 10 months ago
2010
IEEE
—The relevance of instruction parallelization and optimal event scheduling is currently increasing. In particular, because of the high amount of computational power available tod...
MICRO
2010
IEEE
14 years 9 months ago
2010
IEEE
Accelerating program performance via SIMD vector units is very common in modern processors, as evidenced by the use of SSE, MMX, VSE, and VSX SIMD instructions in multimedia, scien...
103
click to vote
CRYPTO
2001
Springer
15 years 4 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...