Solvability by radicals is in polynomial time
Authors:
- 1 April 1985
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 30 (2) , 179-208
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Factoring Polynomials over Algebraic Number FieldsSIAM Journal on Computing, 1985
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- A polynomial bound for the orders of primitive solvable groupsJournal of Algebra, 1982
- Finite Permutation Groups and Finite Simple GroupsBulletin of the London Mathematical Society, 1981
- Some Remarks on Computing Galois GroupsSIAM Journal on Computing, 1979
- Factoring Polynomials Over Algebraic Number FieldsACM Transactions on Mathematical Software, 1976
- An Algorithm for Finding the Blocks of a Permutation GroupMathematics of Computation, 1975
- An algorithm for finding the blocks of a permutation groupMathematics of Computation, 1975
- The determination of Galois groupsMathematics of Computation, 1973
- Computational methods in the study of permutation groups††This research was supported in part by the National Science Foundation.1970