Name
Abstract | ||
|---|---|---|
We give a deterministic polynomial-time algorithm to check whether the Galois group Gal(f) of an input polynomial f(X)∈ℚ[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 nd and, moreover, if Gal(f)∈Γd it computes all the prime factors of # Gal(f). |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11821069_12 | mathematical foundations of computer science |
Keywords | DocType | Volume |
related result,polynomial time nilpotence test,galois group,landau-miller solvability test,time polynomial,deterministic polynomial-time algorithm,prime factor,input polynomial | Conference | abs/cs/0605050 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-37791-3 | 1 |
PageRank | References | Authors |
0.38 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vikraman Arvind | 1 | 296 | 38.18 |
| Piyush P. Kurur | 2 | 88 | 9.41 |