A Polynomial Time Nilpotence Test for Galois Groups and Related Results
| dc.creator | Arvind, V. | |
| dc.creator | Kurur, Piyush P | |
| dc.date | 2006-05-11 | |
| dc.date.accessioned | 2026-07-07T07:09:30Z | |
| dc.date.available | 2026-07-07T07:09:30Z | |
| dc.description | We give a deterministic polynomial-time algorithm to check whether the Galois group $\Gal{f}$ of an input polynomial $f(X) \in \Q[X]$ is nilpotent: the running time is polynomial in $\size{f}$. Also, we generalize the Landau-Miller solvability test to an algorithm that tests if $\Gal{f}$ is in $Γ_d$: this algorithm runs in time polynomial in $\size{f}$ and $n^d$ and, moreover, if $\Gal{f}\inΓ_d$ it computes all the prime factors of $# \Gal{f}$. | |
| dc.description | 12 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0605050 | |
| dc.identifier | http://arxiv.org/abs/cs/0605050 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/111090 | |
| dc.subject | Computational Complexity | |
| dc.subject | Data Structures and Algorithms | |
| dc.title | A Polynomial Time Nilpotence Test for Galois Groups and Related Results | |
| dc.type | text |