4463 search results - page 144 / 893 » computer 2000 |
167
click to vote
MOC
1998
15 years 3 months ago
1998
We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order....
134
Voted
IJON
2000
15 years 3 months ago
2000
We present a software package for the simulation of very large neuronal networks on parallel computers. The package can be run on any system with an implementation of the Message ...
134
Voted
MOC
2000
15 years 3 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 ...
133
click to vote
ACMSE
2000
ACM
15 years 7 months ago
2000
ACM
We present the background and justi cation for a new approachto studying computation and computational complexity. We focus on categories of problems and categories of solutions w...
113
Voted
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
Ever since Adleman [1] solved the Hamilton Path problem using a combinatorial molecular method, many other hard computational problems have been investigated with the proposed DNA ...