|
Prikladnaya Diskretnaya Matematika, 2013, Number 3(21), Pages 112–122
(Mi pdm425)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Computational Methods in Discrete Mathematics
Implementing Coppersmith algorithm for binary matrix sequences on clusters
A. S. Ryzhov Moscow, Russia
Abstract:
This paper concerns implementation of Coppersmith algorithm, which allows to calculate vector generating polynomials. Data representation for binary matrix sequences is considered. Effective parallelization for multicore CPUs and clusters provided.
Keywords:
matrix sequences, Coppersmith algorithm.
Citation:
A. S. Ryzhov, “Implementing Coppersmith algorithm for binary matrix sequences on clusters”, Prikl. Diskr. Mat., 2013, no. 3(21), 112–122
Linking options:
https://www.mathnet.ru/eng/pdm425 https://www.mathnet.ru/eng/pdm/y2013/i3/p112
|
Statistics & downloads: |
Abstract page: | 175 | Full-text PDF : | 113 | References: | 40 | First page: | 1 |
|