Výsledky vyhľadávania - "parallel modular algorithm"

Circuits for computing the GCD of two polynomials over an algebraic number field

Autori: Lars Langemyr

Zdroj: Information Processing Letters. 38:129-134

Predmety: parallel algorithm, Analysis of algorithms and problem complexity, parallel modular algorithm, greatest common divisor of two polynomials, Distributed algorithms, Algebraic number theory computations, complexity, Boolean circuit, Number-theoretic algorithms

Popis súboru: application/xml

Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/ipl/ipl38.html#Langemyr91
https://www.sciencedirect.com/science/article/pii/0020019091902349