Berlekamp–Zassenhaus algorithm: Difference between revisions

Revision as of 17:00, 17 December 2019

Revision as of 13:05, 18 April 2020

Line 28:

| title = Factoring polynomials over large finite fields

| volume = 24

| year = 1970}}.| doi-access = free

}}.

*{{citation

| last1 = Cantor | first1 = David G.

Line 40 ⟶ 41:

| title = A new algorithm for factoring polynomials over finite fields

| volume = 36

| year = 1981}}.| doi-access = free

}}.

*{{citation

| last1 = Geddes

Line 67 ⟶ 69:

| title = Factoring polynomials and the knapsack problem

| volume = 95

| year = 2002}}.| doi-access = free

}}.

*{{citation

| last = Zassenhaus | first = Hans | authorlink = Hans Zassenhaus