2056 search results - page 59 / 412 » time 2000 |
104
click to vote
SIROCCO
2000
15 years 1 months ago
2000
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
125
click to vote
IPL
2000
14 years 11 months ago
2000
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...
MOC
2000
14 years 11 months ago
2000
We treat the time discretization of an initial-value problem for a ous abstract parabolic equation by first using a representation of the solution as an integral along the boundary...
MOC
2000
14 years 11 months 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 ...
MOC
1998
14 years 11 months ago
1998
This paper contains error estimates for covolume discretizations of Maxwell’s equations in three space dimensions. Several estimates are proved. First, an estimate for a semi-dis...