Loading...
Please wait, while we are loading the content...
Similar Documents
On Bivariate Polynomial Factorization over Finite Fields
| Content Provider | Scilit |
|---|---|
| Author | Shparlinski, Igor E. |
| Copyright Year | 1993 |
| Description | This paper shows that a recently proposed approach of D. Q. Wan to bivariate factorization over finite fields, the univariate factoring algorithm of V. Shoup, and the new bound of this paper for the average number of irreducible divisors of polynomials of a given degree over a finite field can be used to design a bivariate factoring algorithm that is polynomial for "almost all" bivariate polynomials. |
| Related Links | https://www.ams.org/mcom/1993-60-202/S0025-5718-1993-1176716-3/S0025-5718-1993-1176716-3.pdf |
| Ending Page | 791 |
| Page Count | 5 |
| Starting Page | 787 |
| ISSN | 00255718 |
| e-ISSN | 10886842 |
| DOI | 10.2307/2153117 |
| Journal | Mathematics of Computation |
| Issue Number | 202 |
| Volume Number | 60 |
| Language | English |
| Publisher | Duke University Press |
| Publisher Date | 1993-04-01 |
| Access Restriction | Open |
| Subject Keyword | Mathematical Physics Finite Fields Bivariate Polynomials Irreducible Shoup Divisors Wan Factorization Over Finite |
| Content Type | Text |
| Resource Type | Article |
| Subject | Applied Mathematics Algebra and Number Theory Computational Mathematics |