Sciweavers

2767 search results - page 15 / 554
» Universal Exponentiation Algorithm
Sort
View
TCS
2002
14 years 11 months ago
MAX3SAT is exponentially hard to approximate if NP has positive dimension
Under the hypothesis that NP has positive p-dimension, we prove that any approximation algorithm A for MAX3SAT must satisfy at least one of the following:
John M. Hitchcock
COLT
2007
Springer
15 years 6 months ago
Learning Permutations with Exponential Weights
We give an algorithm for the on-line learning of permutations. The algorithm maintains its uncertainty about the target permutation as a doubly stochastic weight matrix, and makes...
David P. Helmbold, Manfred K. Warmuth
CTRSA
2009
Springer
127views Cryptology» more  CTRSA 2009»
15 years 6 months ago
Securing RSA against Fault Analysis by Double Addition Chain Exponentiation
Abstract. Fault Analysis is a powerful cryptanalytic technique that enables to break cryptographic implementations embedded in portable devices more efficiently than any other tech...
Matthieu Rivain
ARITH
1999
IEEE
15 years 4 months ago
Montgomery Modular Exponentiation on Reconfigurable Hardware
It is widely recognized that security issues will play a crucial role in the majority of future computer and communication systems. Central tools for achieving system security are...
Thomas Blum
POPL
2001
ACM
16 years 3 days ago
Avoiding exponential explosion: generating compact verification conditions
Current verification condition (VC) generation algorithms, such as weakest preconditions, yield a VC whose size may be exponential in the size of the code fragment being checked. ...
Cormac Flanagan, James B. Saxe