Circuits for computing the GCD of two polynomials over an algebraic number field
From MaRDI portal
Publication:1178209
DOI10.1016/0020-0190(91)90234-9zbMath0745.11055OpenAlexW2091858911MaRDI QIDQ1178209
Publication date: 26 June 1992
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(91)90234-9
complexityparallel algorithmBoolean circuitgreatest common divisor of two polynomialsparallel modular algorithm
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Distributed algorithms (68W15)
Related Items (1)
Cites Work
- Unnamed Item
- The computation of polynomial greatest common divisors over an algebraic number field
- On computing the determinant in small parallel time using a small number of processors
- Circuits for computing the GCD of two polynomials over an algebraic number field
- On multiplication in algebraic extension fields
- Approximate formulas for some functions of prime numbers
- A taxonomy of problems with fast parallel algorithms
- Parallel computation for well-endowed rings and space-bounded probabilistic machines
- Logarithmic Depth Circuits for Algebraic Functions
- Fast Parallel Matrix Inversion Algorithms
- Fast parallel matrix and GCD computations
- Subresultants and Reduced Polynomial Remainder Sequences
This page was built for publication: Circuits for computing the GCD of two polynomials over an algebraic number field
