Arnold Knopfmacher  Home/Search
Context Related
| wits.ac.za/science/number_...degree4.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wits.ac.za/science/numb...apublic (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Let F~_q[X] denote the multiplicative semigroup of monic polynomials in one indeterminate X over a finite field F_q. We determine for each fixed q... (Update)
Similar documents based on text: More All
1.0: A Simple Card Guessing Game Revisited - Knopfmacher, Prodinger (2000) (Correct)
0.5: Nets and Sequences obtained from Irreducible.. - Knopfmacher, Ridley.. (Correct)
0.5: The Complete Analysis of a Polynomial Factorization.. - Flajolet, Gourdon.. (1998) (Correct)
Related documents from co-citation: More All
3: The art of computer programming (context) - Knuth - 1973
2: Counting irreducible factors of polynomials over a finite field (context) - Knopfmacher, Knopfmacher - 1993
2: the distribution of the number of roots of polynomials and explicit logspace ext.. - Hartman, Raz - 2000
BibTeX entry: (Update)
Knopfmacher, A. On the degrees of irreducible factors of polynomials over a finite field. Disc. Math. 196 (1999), 197--206. http://citeseer.ist.psu.edu/knopfmacher99degrees.html More
@article{ knopfmacher99degrees,
author = "A. Knopfmacher",
title = "On the degrees of irreducible factors of polynomials over a finite field",
journal = "Disc. Math.",
volume = "196",
pages = "197--206",
year = "1999",
url = "citeseer.ist.psu.edu/knopfmacher99degrees.html" }
Citations (may not include all citations):2003 The art of computer programming (context) - Knuth - 1981
151 Singularity Analysis of generating functions (context) - Flajolet, Odlyzko - 1990
20 the deterministic complexity of factoring polynomials over n.. - Shoup - 1990
19 Gaussian limiting distributions for the number of components.. (context) - Flajolet, Soria - 1990
14 Computing Frobenius maps and factoring polynomials - Gathen, Shoup - 1992
9 Distinct degree factorizations for polynomials over a nite e.. (context) - Knopfmacher, Warlimont - 1995
9 Three problems in combinatorial asymptotics (context) - Wilf - 1983
7 Lecture Notes in Computer Science (context) - Flajolet, Gourdon et al. - 1996
5 A new algorithm for factoring polynomials over nite elds (context) - Cantor, Zassenhaus - 1981
3 Factoring polynomials using fewer random bits - Bach, Shoup - 1990
3 Probabilistic algorithms in nite elds (context) - Ben-Or - 1981
2 Counting irreducible factors of polynomials over a nite eld (context) - Knopfmacher, Knopfmacher - 1993
2 Computational and algorithmic problems in nite elds (context) - Shparlinski - 1992
Documents on the same site (http://www.wits.ac.za/science/number_theory/apublic.htm): More
Engel Expansions of q-Series by Computer Algebra - Andrews, Knopfmacher, Paule.. (2000) (Correct)
On the Largest Degree of an Irreducible Factor of a.. - Knopfmacher.. (1997) (Correct)
Combinatorics of Geometrically Distributed Random.. - Knopfmacher, Prodinger (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC