The Subresultant PRS Algorithm

Authors:
W. S. Brown
Affiliations:
Bell Laboratories, 600 Mountain Ave., Murray Hill, NJ
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1978

Citing 9
Cited 17

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

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
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)
Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries

ACM Transactions on Mathematical Software (TOMS)
Computing polynomial resultants: Bezout's determinant vs. Collins' reduced P.R.S. algorithm

Communications of the ACM
Letters to the editor: comment on a paper by Ku and Adler

Communications of the ACM
The EZ GCD algorithm

ACM '73 Proceedings of the ACM annual conference
An improved non-modular polynomial GCD algorithm

ACM SIGSAM Bulletin

Computer Algebra: Past and Future

Journal of Symbolic Computation
GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation

Journal of Symbolic Computation
Automatic parameterization of rational curves and surfaces IV: algebraic space curves

ACM Transactions on Graphics (TOG) - Special issue on computer-aided design
Power series remainder sequences and Padé fractions over an integral domain

Journal of Symbolic Computation
An analysis of the subresultant algorithm over an algebraic number field

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Three new algorithms for multivariate polynomial GCD

Journal of Symbolic Computation
Subresultants revisited

Theoretical Computer Science - Latin American theoretical informatics
Systems of rational polynomial equations have polynomial size approximate zeros on the average

Journal of Complexity
A p-adic algorithm for univariate partial fractions

SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
The EEZ-GCD algorithm

ACM SIGSAM Bulletin
Exact, efficient, and complete arrangement computation for cubic curves

Computational Geometry: Theory and Applications
Using an Efficient Sparse Minor Expansion Algorithm to Compute Polynomial Subresultants and the Greatest Common Denominator

IEEE Transactions on Computers
Exact, efficient, and complete arrangement computation for cubic curves

Computational Geometry: Theory and Applications
Complete, exact and efficient implementation for computing the adjacency graph of an arrangement of quadrics

ESA'07 Proceedings of the 15th annual European conference on Algorithms
A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics

Journal of Symbolic Computation
Improved polynomial remainder sequences for ore polynomials

ACM Communications in Computer Algebra
Improved polynomial remainder sequences for Ore polynomials

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract