Revision as of 14:59, 5 June 2012 edit Mecanismo (talk \| contribs) Extended confirmed users 3,744 edits m added a line break to make the text a bit more readable ← Previous edit		Revision as of 22:16, 6 January 2013 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,646 edits →References: more bibliographic detail; fix Berlekamp 1970 title; remove extra whitespace between entries Next edit →
Line 7: ==References== {{citation Berlekamp, E. R. "Factoring Polynomials over Finite Fields." Bell System Technical J. 46, 1853–1859, 1967. \| last = Berlekamp \| first = E. R. \| authorlink = Elwyn Berlekamp \| journal = [[Bell System Technical Journal]] * Berlekamp, E. R. "Factoring Polynomials over Finite Fields." Math. Comput. 24, 713–735, 1970. \| mr = 0219231 \| pages = 1853–1859 * Cantor, D. G. and Zassenhaus, H. "A New Algorithm for Factoring Polynomials over Finite Fields." Math. Comput. 36, 587–592, 1981. \| title = Factoring polynomials over finite fields \| url = http://www.alcatel.hu/bstj/vol46-1967/articles/bstj46-8-1853.pdf * Geddes, K. O.; Czapor, S. R.; and Labahn, G. Algorithms for Computer Algebra. Amsterdam, Netherlands: Kluwer, 1992. \| volume = 46 \| year = 1967}}. * van Hoeij, M. "Factoring Polynomials and the Knapsack Problem." J. Number Th. 95, 167–189, 2002. {{citation \| last = Berlekamp \| first = E. R. \| authorlink = Elwyn Berlekamp Zassenhaus, H. "On Hensel Factorization, I." J. Number Th. 1, 291–311, 1969. \| doi = 10.2307/2004849 \| journal = [[Mathematics of Computation]] \| jstor = 2004849 \| mr = 0276200 \| pages = 713–735 \| title = Factoring polynomials over large finite fields \| volume = 24 \| year = 1970}}. {{citation \| last1 = Cantor \| first1 = David G. \| last2 = Zassenhaus \| first2 = Hans \| author2-link = Hans Zassenhaus \| doi = 10.2307/2007663 \| issue = 154 \| journal = [[Mathematics of Computation]] \| jstor = 2007663 \| mr = 606517 \| pages = 587–592 \| title = A new algorithm for factoring polynomials over finite fields \| volume = 36 \| year = 1981}}. {{citation \| last1 = Geddes \| first1 = K. O. \| last2 = Czapor \| first2 = S. R. \| last3 = Labahn \| first3 = G. \| doi = 10.1007/b102438 \| isbn = 0-7923-9259-0 \| ___location = Boston, MA \| mr = 1256483 \| publisher = Kluwer Academic Publishers \| title = Algorithms for computer algebra \| year = 1992}}. {{citation \| last = van Hoeij \| first = Mark \| doi = 10.1016/S0022-314X(01)92763-5 \| issue = 2 \| journal = [[Journal of Number Theory]] \| mr = 1924096 \| pages = 167–189 \| title = Factoring polynomials and the knapsack problem \| volume = 95 \| year = 2002}}. {{citation \| last = Zassenhaus \| first = Hans \| authorlink = Hans Zassenhaus \| doi = 10.1016/0022-314X(69)90047-X \| journal = [[Journal of Number Theory]] \| mr = 0242793 \| pages = 291–311 \| title = On Hensel factorization. I \| volume = 1 \| year = 1969}}. ==External links==

Berlekamp–Zassenhaus algorithm: Difference between revisions