Sciweavers

1809 search results - page 6 / 362
» Weakly Computable Real Numbers
Sort
View
MOC
2000
89views more  MOC 2000»
13 years 7 months ago
Computation of relative class numbers of CM-fields by using Hecke L-functions
We develop an efficient technique for computing values at s = 1 of Hecke L-functions. We apply this technique to the computation of relative class numbers of non-abelian CM-fields ...
Stéphane Louboutin
NDSS
1999
IEEE
13 years 12 months ago
A Real-World Analysis of Kerberos Password Security
Kerberos is a distributed authentication system that many organizations use to handle domain-wide password security. Although it has been known for quite some time that Kerberos i...
Thomas D. Wu
CIE
2005
Springer
14 years 1 months ago
Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
George Barmpalias