scientific article; zbMATH DE number 481965

Publication date: 14 December 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

interpolation complexity bibliography greatest common divisor polynomials factorization irreducibility elimination multivariate univariate Hensel algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Factorization (11Y05) Computational number theory (11Y99)

Related Items

Solving composite sum of powers via Padé approximation and orthogonal polynomials with application to optimal PWM problem, Fast computation of discrete invariants associated to a differential rational mapping, Treatment of near-breakdown in the CGS algorithm, Zero testing of algebraic functions, Black-box polynomial resultants, Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations, Lifting and recombination techniques for absolute factorization, Finding linear dependencies in integration-by-parts equations: a Monte Carlo approach, Ideals of spaces of degenerate matrices, Parametric nonlinear discrete optimization over well-described sets and matroid intersections, A note on systems of equations of power sums, Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study, Semi-numerical absolute factorization of polynomials with integer coefficients, Deformation techniques to solve generalised Pham systems, Walks with small steps in the 4D-orthant, Checking properties of polynomials, Univariate polynomial factorization over finite fields, Techniques for exploiting structure in matrix formulae of the sparse resultant, Implicitization of curves and (hyper)surfaces using predicted support, Generating power of lazy semantics, An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form, Differential Elimination for Dynamical Models via Projections with Applications to Structural Identifiability, New Sparse Multivariate Polynomial Factorization Algorithms over Integers, Sparse resultants and straight-line programs, Exact hierarchical reductions of dynamical models via linear transformations, Subresultants revisited., \textsc{Rings}: an efficient Java/Scala library for polynomial rings, Methodologies of Symbolic Computation, Counting points on genus-3 hyperelliptic curves with explicit real multiplication, Use of algebraically independent numbers for zero recognition of polynomial terms., A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x\)], Fast computation of special resultants, From an approximate to an exact absolute polynomial factorization, Computation of unirational fields, Improved dense multivariate polynomial factorization algorithms, Elimination for generic sparse polynomial systems, New recombination algorithms for bivariate polynomial factorization based on Hensel lifting, Various new expressions for subresultants and their applications, A parser for the interval evaluation of analytical functions and its application to engineering problems, Improved algorithms for computing determinants and resultants, Detecting algebraic curves in bad position, A Gröbner free alternative for polynomial system solving, Parity of the number of irreducible factors for composite polynomials, Noisy interpolation of sparse polynomials in finite fields, Interrogating witnesses for geometric constraint solving, Lagrange and the solution of numerical equations, An improved EZ-GCD algorithm for multivariate polynomials, Sharp precision in Hensel lifting for bivariate polynomial factorization, Matrices in elimination theory, Deformation techniques for sparse systems, Zero testing of \(p\)-adic and modular polynomials, Predicting zero coefficients in formal power series computations., Symbolic and numeric methods for exploiting structure in constructing resultant matrices, Linear differential operators for polynomial equations, Formalization of Bernstein polynomials and applications to global optimization, Exact linear reduction for rational dynamical systems