Timeline for Algorithm for determining whether two polynomials have the same splitting field
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 2, 2013 at 4:51 | comment | added | Jonah Sinick | This is nice. I don't immediately see why the effective Chebotarev density theorem tells you when you're done. But it's nice. wccanard's answer seems potentially more conceptually primitive, but I guess one would need to take a close look at the algorithm to be sure. | |
| Jan 2, 2013 at 4:48 | vote | accept | Jonah Sinick | ||
| Jan 2, 2013 at 4:37 | comment | added | Filippo Alberto Edoardo | +1 for "the value of 1000 which actually gives you a proof" | |
| Jan 2, 2013 at 1:53 | comment | added | JSE | Depends what the bounds in Lagarias-Odlyzko are and I don't have them in my head right now. You might look at a recent paper of Kowalski and Zywina which carries out a computation of this kind in real life. | |
| Jan 1, 2013 at 22:33 | comment | added | Greg Kuperberg | So, does this rigorously establish a randomized polynomial time algorithm for the original question, assuming GRH? | |
| Jan 1, 2013 at 22:02 | history | answered | JSE | CC BY-SA 3.0 |