scientific article

No author found.

Publication date: 1982

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

resultants Sturm sequences polynomial greatest common divisors

Software, source code, etc. for problems pertaining to commutative algebra (13-04) Polynomials over commutative rings (13B25) Integral domains (13G05) Software, source code, etc. for problems pertaining to field theory (12-04)

Related Items (60)

Towards faster real algebraic numbers ⋮ Bezout matrices, subresultant polynomials and parameters ⋮ Computer algebra: Past and future ⋮ Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients ⋮ Testing the shift-equivalence of polynomials using quantum machines ⋮ Computer algebra applied to itself ⋮ A new approach for constructing subresultants ⋮ A polynomial-time algorithm for the topological type of real algebraic curve ⋮ Number of common roots and resultant of two tropical univariate polynomials ⋮ Résolution du problème de l'ellipse et du cercle par l'algorithme de Hörmander ⋮ A hybrid approach to the computation of the inertia of a parametric family of Bézoutians with application to some stability problems for bivariate polynomials ⋮ Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation ⋮ Cauchy index computation ⋮ On the complexity of computing the greatest common divisor of several univariate polynomials ⋮ Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines. ⋮ Double Sylvester sums for subresultants and multi-Schur functions. ⋮ Subresultants of \((x-\alpha)^m\) and \((x-\beta)^n\), Jacobi polynomials and complexity ⋮ A Bridge between Euclid and Buchberger: (An Attempt to Enhance Gröbner Basis Algorithm by PRSs and GCDs) ⋮ An elementary approach to subresultants theory. ⋮ Subresultants revisited. ⋮ Improved polynomial remainder sequences for Ore polynomials ⋮ A complete algorithm for counting real solutions of polynomial systems of equations and inequalities. ⋮ A subresultant-like theory for Buchberger's procedure ⋮ Asymptotes of space curves ⋮ A singly exponential stratification scheme for real semi-algebraic varieties and its applications ⋮ Birational properties of the gap subresultant varieties ⋮ Complexity bounds for zero-test algorithms ⋮ Unnamed Item ⋮ A condition for multiplicity structure of univariate polynomials ⋮ Determinantal formulae for the solution set of zero-dimensional ideals ⋮ Recursive polynomial remainder sequence and its subresultants ⋮ The inverse of an automorphism in polynomial time ⋮ Resultants over commutative idempotent semirings. I: Algebraic aspect ⋮ Implicit representation of rational parametric surfaces ⋮ On the complexity of the Lickteig-Roy subresultant algorithm ⋮ An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups ⋮ Sylvester-Habicht sequences and fast Cauchy index computation ⋮ Various new expressions for subresultants and their applications ⋮ Detecting algebraic curves in bad position ⋮ Squarefree decomposition of univariate polynomials depending on a parameter. Application to the integration of parametric rational functions ⋮ A new approach to characterizing the relative position of two ellipses depending on one parameter ⋮ Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets ⋮ The computation of polynomial greatest common divisors over an algebraic number field ⋮ Spécialisation de la suite de Sturm et sous-résultants (I) ⋮ Exact, efficient, and complete arrangement computation for cubic curves ⋮ The number of tetrahedra sharing the same metric invariants via symbolic and numerical computations ⋮ Recent advances on determining the number of real roots of parametric polynomials ⋮ Sur la complexité du principe de Tarski-Seidenberg ⋮ Complexity of computation on real algebraic numbers ⋮ Generators of the ideal of an algebraic space curve ⋮ Decomposing algebraic sets using Gröbner bases ⋮ New structure theorem for subresultants ⋮ An efficient algorithm for the stratification and triangulation of an algebraic surface ⋮ An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials ⋮ Algorithme de Bareiss, algorithme des sous-résultants ⋮ Efficient topology determination of implicitly defined algebraic plane curves. ⋮ Complexity of factoring and calculating the GCD of linear ordinary differential operators ⋮ Computation of the dual of a plane projective curve ⋮ An algorithm for isolating the real solutions of semi-algebraic systems ⋮ Systems of rational polynomial equations have polynomial size approximate zeros on the average

This page was built for publication: