6274 search results - page 950 / 1255 » From query complexity to computational complexity |
178
click to vote
IMR
2005
Springer
16 years 23 days ago
2005
Springer
This paper describes an interior surface generation method and a strategy for all-hexahedral mesh generation. It is well known that a solid homeomorphic to a ball with even number...
178
click to vote
PKC
2005
Springer
16 years 22 days ago
2005
Springer
Coppersmith, Franklin, Patarin, and Reiter show that given two RSA cryptograms xe mod N and (ax + b)e mod N for known constants a, b ∈ ZN , one can compute x in O(e log2 e) ZN -o...
212
click to vote
RTA
2005
Springer
16 years 22 days ago
2005
Springer
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
159
click to vote
STACS
2005
Springer
16 years 22 days ago
2005
Springer
We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on recent results on randomized roundings respectin...
252
click to vote
TLCA
2005
Springer
16 years 22 days ago
2005
Springer
Two common misbeliefs about encodings of the λ-calculus in interaction nets (INs) are that they are good only for strategies that are not very well understood (e.g. optimal reduct...