2767 search results - page 16 / 554 » Universal Exponentiation Algorithm |
CHES
2000
Springer
14 years 2 months ago
2000
Springer
The Montgomery multiplication is commonly used as the core algorithm for cryptosystems based on modular arithmetic. With the advent of new classes of attacks (timing attacks, power...
TSP
2008
13 years 9 months ago
2008
High Resolution (HR) methods are known to provide accurate frequency estimates for discrete spectra. The Polynomial Amplitude Complex Exponentials (PACE) model, also called quasipo...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
FOCS
2004
IEEE
14 years 1 months ago
2004
IEEE
The Lemke
STOC
2002
ACM
14 years 10 months ago
2002
ACM
: This paper gives two distinct proofs of an exponential separation between regular resolution and unrestricted resolution. The previous best known separation between these systems...