| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 403026 | Journal of Symbolic Computation | 2016 | 4 Pages |
Abstract
We present a deterministic polynomial-time algorithm that determines whether a finite module over a finite commutative ring is cyclic, and if it is, outputs a generator.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
H.W. Lenstra Jr., A. Silverberg,