An analysis of the subresultant algorithm over an algebraic number field

Authors:
Lars Langemyr
Affiliations:
Numerical Analysis and Computing Science, Royal Institute of Technology, S-100 44 Stockholm, Sweden and Wilhelm-Schickard-Institut für Informatik, Universitat Tübingen, Auf dem Sand 13, ...
Venue:
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Year:
1991

Citing 5
Cited 1

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)
The Subresultant PRS Algorithm

ACM Transactions on Mathematical Software (TOMS)
An Asymptotically Fast Probabilitstic Algorithm for Computing Polynominal GCD's over an Algebraic Number Field

AAECC-8 Proceedings of the 8th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Algorithms for polynomials over a real algebraic number field.

Algorithms for polynomials over a real algebraic number field.

Minimum converging precision of the QR-factorization algorithm for real polynomial GCD

Proceedings of the 2007 international symposium on Symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract