Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A simple proof of the validity of the reduced prs algorithm

From MaRDI portal
Publication:1099223
Jump to:navigation, search

DOI10.1007/BF02278715zbMath0638.13009MaRDI QIDQ1099223

B. George

Publication date: 1987

Published in: Computing (Search for Journal in Brave)


zbMATH Keywords

univariate polynomialsreduced polynomial remainder sequence algorithm


Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Polynomials over commutative rings (13B25)


Related Items

A new method for computing polynomial greatest common divisors and polynomial remainder sequences



Cites Work

  • Subresultants and Reduced Polynomial Remainder Sequences
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1099223&oldid=13133239"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 02:31.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki