RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika // Archive

Prikl. Diskr. Mat., 2013 Number 3(21), Pages 112–122 (Mi pdm425)

This article is cited 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.

UDC: 519.7



© Steklov Math. Inst. of RAS, 2024