Circuits for computing the GCD of two polynomials over an algebraic number field (Q1178209)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Circuits for computing the GCD of two polynomials over an algebraic number field |
scientific article; zbMATH DE number 23327
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Circuits for computing the GCD of two polynomials over an algebraic number field |
scientific article; zbMATH DE number 23327 |
Statements
Circuits for computing the GCD of two polynomials over an algebraic number field (English)
0 references
26 June 1992
0 references
A parallel algorithm, and a parallel modular algorithm, are given for computing the greatest common divisor of two polynomials over an algebraic number field. The complexities of the two algorithms are analysed for an \(L\)-uniform circuit family in the first case, and for \(L\)-uniform and \(P\)-uniform circuit families in the second case (i.e. for families with, respectively, logarithmic or polynomial depth).
0 references
complexity
0 references
Boolean circuit
0 references
parallel algorithm
0 references
parallel modular algorithm
0 references
greatest common divisor of two polynomials
0 references
