Testing nilpotence of Galois groups in polynomial time

DOI10.1145/2229163.2229176zbMATH Open1295.68224OpenAlexW2014482702MaRDI QIDQ3189074FDOQ3189074

Authors: Vikraman Arvind, Piyush P. Kurur 

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2229163.2229176

Recommendations

• A Polynomial Time Nilpotence Test for Galois Groups and Related Results
• scientific article; zbMATH DE number 3924140
• Deciding the nilpotency of the Galois group by computing elements in the centre
• Computing in Nilpotent Matrix Groups
• Solvability by radicals is in polynomial time

zbMATH Keywords

Galois grouppolynomial timenilpotenceunivariate polynomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Separable extensions, Galois theory (12F10) Finite nilpotent groups, (p)-groups (20D15)

Cited In (4)

• A Polynomial Time Nilpotence Test for Galois Groups and Related Results
• Detecting fast solvability of equations via small powerful Galois groups
• Solvability by radicals is in polynomial time
• Title not available (Why is that?)

This page was built for publication: Testing nilpotence of Galois groups in polynomial time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189074)