Subresultants revisited

Authors:
Joachim von zur Gathen;Thomas Lücking
Affiliations:
Fachbereich Mathematik-Informatik, Universität Paderborn, D-33095 Paderborn, Germany;Fachbereich Mathematik-Informatik, Universität Paderborn, D-33095 Paderborn, Germany
Venue:
Theoretical Computer Science - Latin American theoretical informatics
Year:
2003

Citing 20
Cited 12

Parallel algorithms for algebraic problems

SIAM Journal on Computing
Algorithms for computer algebra

Algorithms for computer algebra
The Habicht approach to subresultants

Journal of Symbolic Computation
Subresultants under composition

Journal of Symbolic Computation
Asymptotically fast computation of subresultants

ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
A note on subresultants and the Lazard/Rioboo/Trager formula in rational function integration

Journal of Symbolic Computation
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The search for the maximum of a polynomial

Journal of Symbolic Computation
Modern computer algebra

Modern computer algebra
Subresultants and Reduced Polynomial Remainder Sequences

Journal of the ACM (JACM)
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors

Journal of the ACM (JACM)
On Euclid's Algorithm and the Theory of Subresultants

Journal of the ACM (JACM)
The Calculation of Multivariate Polynomial Resultants

Journal of the ACM (JACM)
Fundamental problems of algorithmic algebra

Fundamental problems of algorithmic algebra
New structure theorem for subresultants

Journal of Symbolic Computation - Special issue on symbolic computation in algebra, analysis and geometry
The Subresultant PRS Algorithm

ACM Transactions on Mathematical Software (TOMS)
Sylvester—Habicht sequences and fast Cauchy index computation

Journal of Symbolic Computation
Polynomial Algorithms in Computer Algebra

Polynomial Algorithms in Computer Algebra
Subresultants Revisited

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
GCD of many integers (extended abstract)

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics

Exact, efficient, and complete arrangement computation for cubic curves

Computational Geometry: Theory and Applications
Implementing the cylindrical algebraic decomposition within the Coq system

Mathematical Structures in Computer Science
Lifting and recombination techniques for absolute factorization

Journal of Complexity
On the complexity of real solving bivariate systems

Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Exact and efficient 2D-arrangements of arbitrary algebraic curves

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Real Algebraic Numbers: Complexity Analysis and Experimentation

Reliable Implementation of Real Number Algorithms: Theory and Practice
On the asymptotic and practical complexity of solving bivariate systems over the reals

Journal of Symbolic Computation
Exact, efficient, and complete arrangement computation for cubic curves

Computational Geometry: Theory and Applications
Algebraic and numerical algorithms

Algorithms and theory of computation handbook
Proving formally the implementation of an efficient gcd algorithm for polynomials

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Recursive polynomial remainder sequence and the nested subresultants

CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
A new algorithmic scheme for computing characteristic sets

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Subresultants and polynomial remainder sequences are an important tool in polynomial computer algebra. In this survey, we sketch the history, formalize a unified framework for the various notions, derive a number of results from the early 1970s within our framework, and report on implementations.