scientific article; zbMATH DE number 3922806
From MaRDI portal
Publication:3698903
Recommendations
- Polynomial Remainder Sequences and Determinants
- Theory of multiple polynomial remainder sequence
- Generic sequences of polynomials
- Euclidean remainders for generalized polynomials
- scientific article; zbMATH DE number 4049035
- Generalized Mignotte's sequences over polynomial rings
- scientific article; zbMATH DE number 3913669
- Polynomial generalizations of the Pell sequences and the Fibonacci sequence
- scientific article; zbMATH DE number 2145143
- Improved polynomial remainder sequences for Ore polynomials
Cited in
(79)- Generators of the ideal of an algebraic space curve
- An efficient algorithm for the stratification and triangulation of an algebraic surface
- Theory of multiple polynomial remainder sequence
- Computer algebra: Past and future
- A simple proof of the validity of the reduced prs algorithm
- Computer algebra applied to itself
- Euclidean remainders for generalized polynomials
- A polynomial-time algorithm for the topological type of real algebraic curve
- 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
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications
- Determinantal formulae for the solution set of zero-dimensional ideals
- The inverse of an automorphism in polynomial time
- Implicit representation of rational parametric surfaces
- Primitive polynomial remainder sequences in elimination theory
- Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients
- Testing the shift-equivalence of polynomials using quantum machines
- Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines.
- Double Sylvester sums for subresultants and multi-Schur functions.
- An elementary approach to subresultants theory.
- Subresultants revisited.
- A complete algorithm for counting real solutions of polynomial systems of equations and inequalities.
- New structure theorem for subresultants
- Number of common roots and resultant of two tropical univariate polynomials
- On the complexity of the Lickteig-Roy subresultant algorithm
- Various new expressions for subresultants and their applications
- Recent advances on determining the number of real roots of parametric polynomials
- Decomposing algebraic sets using Gröbner bases
- Determinant polynomial sequences
- Efficient topology determination of implicitly defined algebraic plane curves.
- 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
- Towards faster real algebraic numbers
- Matrix computation of subresultant polynomial remainder sequences in integral domains
- The Habicht approach to subresultants
- The number of tetrahedra sharing the same metric invariants via symbolic and numerical computations
- Subresultants of \((x-\alpha)^m\) and \((x-\beta)^n\), Jacobi polynomials and complexity
- A condition for multiplicity structure of univariate polynomials
- Improved polynomial remainder sequences for Ore polynomials
- A subresultant-like theory for Buchberger's procedure
- Birational properties of the gap subresultant varieties
- Complexity bounds for zero-test algorithms
- A new approach to characterizing the relative position of two ellipses depending on one parameter
- Exact, efficient, and complete arrangement computation for cubic curves
- An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
- scientific article; zbMATH DE number 1574467 (Why is no real title available?)
- Generalized Mignotte's sequences over polynomial rings
- Algorithme de Bareiss, algorithme des sous-résultants
- Spécialisation de la suite de Sturm et sous-résultants (I)
- Résolution du problème de l'ellipse et du cercle par l'algorithme de Hörmander
- scientific article; zbMATH DE number 3913669 (Why is no real title available?)
- scientific article; zbMATH DE number 4049035 (Why is no real title available?)
- scientific article; zbMATH DE number 24073 (Why is no real title available?)
- scientific article; zbMATH DE number 1273655 (Why is no real title available?)
- scientific article; zbMATH DE number 1512700 (Why is no real title available?)
- On the remainders obtained in finding the greatest common divisor of two polynomials
- Sur la complexité du principe de Tarski-Seidenberg
- Asymptotes of space curves
- Resultants over commutative idempotent semirings. I: Algebraic aspect
- On the complexity of computing the greatest common divisor of several univariate polynomials
- 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
- A vectorial approach to generalize the remainder theorem
- 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
- Detecting algebraic curves in bad position
- Squarefree decomposition of univariate polynomials depending on a parameter. Application to the integration of parametric rational functions
- A Bridge between Euclid and Buchberger: (An Attempt to Enhance Gröbner Basis Algorithm by PRSs and GCDs)
- Parametric ``non-nested discriminants for multiplicities of univariate polynomials
- Infinity branches and asymptotic analysis of algebraic space curves: new techniques and applications
- A first approach to the Burchnall-Chaundy theory for quadratic algebras having PBW bases
- Complexity of computation on real algebraic numbers
- Complexity of factoring and calculating the GCD of linear ordinary differential operators
- Bezout matrices, subresultant polynomials and parameters
- A new approach for constructing subresultants
- Recursive polynomial remainder sequence and its subresultants
- Generic sequences of polynomials
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 Q3698903)
