Analysis of Rabin's irreducibility test for polynomials over finite fields
We give a precise average-case analysis of Rabin's algorithm for testing the irreducibility of polynomials over finite fields. The main technical contribution of the paper is the study of the probability that a random polynomial of degree n contains an irreducible factor of degree dividing several m...
Na minha lista:
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | report |
| Publicado em: |
2001
|
| Assuntos: | |
| Acesso em linha: | http://hdl.handle.net/20.500.12008/3455 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|