ROOT-FINDING ALGORITHM FOR UNIVARIATE POLYNOMIALS WITH COEFFICIENTS FROM K[X,Y]
Deterministic polynomial-time root-finding algorithm for univariate polynomials with coefficients from k[x,y] where k is a field of any characteristic is constructed. Our algorithm can be viewed as an extension of the Roth-Ruckenstein's root-finding algorithm to polynomials from k[x,y][T].
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Don State Technical University
2007-09-01
|
| Series: | Advanced Engineering Research |
| Online Access: | https://www.vestnik-donstu.ru/jour/article/view/1301 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|