Algorithms in pure mathematics

From MaRDI portal





This article, written on the level of graduate students in pure mathematics with no prior computational experience, gives an intoduction to the study of group-theoretical algorithms. Algorithms mentioned are the test for solvability of a Galois group (for example using the method of \textit{S. Landau} [EUROSAM 84, Symbolic and algebraic computation, Proc. int. Symp., Cambridge/Engl. 1984, Lect. Notes Comput. Sci. 174, 225-236 (1984; Zbl 0577.68055)]), as well as the computation of Sylow subgroups (following \textit{W. M. Kantor} [J. Comput. Syst. Sci. 30, 359-394 (1985; Zbl 0573.20022)] and \textit{P. Morje} [DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 28, 257-272 (1997; Zbl 0878.20005)]). It is emphasized that ``good algorithm might mean different things in theory and practice. For the entire collection see [Zbl 0978.00022].











This page was built for publication: Algorithms in pure mathematics

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