2181 search results - page 121 / 437 » The restriction scaffold problem |
104
Voted
CORR
2008
Springer
15 years 23 days ago
2008
Springer
In this survey paper we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Amba...
106
Voted
CSJM
2006
15 years 22 days ago
2006
Several variants of new digital signature schemes (DSS) based on the discrete logarithm and factorization problems have been proposed. Considered DSS are characterized in that a n...
CORR
2007
Springer
15 years 20 days ago
2007
Springer
We introduce hybrid branching-time logics as extensions of CT L-like logics with hybrid machinery such as the downarrow-operator. Following recent work in the linear framework, we...
102
click to vote
JDA
2008
15 years 20 days ago
2008
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
105
Voted
MOC
2000
15 years 14 days ago
2000
We describe an adaptation of the number field sieve to the problem of computing logarithms in a finite field. We conjecture that the running time of the algorithm, when restricted ...