Timeline for Polynomial factoring over finite fields
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 25, 2016 at 20:53 | answer | added | Timothy Chow | timeline score: 8 | |
| Jan 25, 2016 at 0:36 | review | Close votes | |||
| Jan 25, 2016 at 17:35 | |||||
| Jan 25, 2016 at 0:11 | comment | added | user76479 | @nfdc23 Good problem do not know. | |
| Jan 25, 2016 at 0:08 | comment | added | nfdc23 | The above are for 1-variable polynomials over finite fields. For $m>1$ variables is it comparable in difficulty to factoring polynomials in $m-1$ variables over $\mathbf{Z}$? | |
| Jan 24, 2016 at 23:54 | history | edited | user76479 | CC BY-SA 3.0 |
added 12 characters in body
|
| Jan 24, 2016 at 23:53 | comment | added | nfdc23 | For complexity of the C-Z algorithm see Theorem 5 on page 20 of digitalcommons.uconn.edu/cgi/… for its complexity (and perhaps Chapter 6 of amazon.com/Algebraic-Coding-Theory-Revised-Edition/dp/… gives further information). | |
| Jan 24, 2016 at 23:51 | comment | added | Douglas Zare | The Cantor-Zassenhaus algorithm is commonly used. en.wikipedia.org/wiki/Cantor%E2%80%93Zassenhaus_algorithm | |
| Jan 24, 2016 at 23:39 | history | asked | user76479 | CC BY-SA 3.0 |