scientific article; zbMATH DE number 2151224
From MaRDI portal
Publication:4660692
Recommendations
- scientific article; zbMATH DE number 1263394
- The computation of polynomial greatest common divisors over an algebraic number field
- Computing GCDs of polynomials over algebraic number fields
- On the design and implementation of Brown's algorithm over the integers and number fields
- The computation of polynomial greatest common divisors over an algebraic number field
Cited in
(16)- On the asymptotic and practical complexity of solving bivariate systems over the reals
- Fast arithmetic for triangular sets: from theory to practice
- The complexity of computing all subfields of an algebraic number field
- Univariate real root isolation in an extension field and applications
- Modular dynamic evaluation
- On the design and implementation of Brown's algorithm over the integers and number fields
- scientific article; zbMATH DE number 16654 (Why is no real title available?)
- In-place arithmetic for univariate polynomials over an algebraic number field
- A sparse modular GCD algorithm for polynomials over algebraic function fields
- The computation of polynomial greatest common divisors over an algebraic number field
- Fundamentals of Computation Theory
- Computing Logarithmic Parts by Evaluation Homomorphisms✱
- Computing GCDs of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions
- Homotopy techniques for multiplication modulo triangular sets
- A modular algorithm to compute the resultant of multivariate polynomials over algebraic number fields presented with multiple extensions
- A failure probability analysis of a modular algorithm to compute the monic GCD of multivariate polynomials over algebraic number fields \({\mathbb{Q}(\alpha_1,\ldots,\alpha_n)} \)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4660692)
