Algorithmic Methods in Algebra and Number Theory

Introduction. R. B"ffgen and M.A. Reichert, Computing the Decomposition of Primes p and p-adic Absolute Values in Semi-Single Algebras over (?). J. Buchmann and H.C. Williams, On Principal Ideal Testing in Algebraic Number Fields. L. Cerlienco, M. Mignotte, and F. Piras, Computing the Measure of a Polynomial. H. Cohn and J.I. Deutsch, Application of Symbolic Manipulation to the Hecke Transformations of Modular Forms in Two Variables. C. Eckhardt, Computation of Class Numbers by an Analytical Method. H.G. Folz and H.G. Zimmer, What is the Rank of the Demjanenko Matrix? D.J. Ford, The Construction of Maximal Orders Over a Dedekind Domain. E. Kaltofen, Deterministic Irreducibility Testing of Polynomials over Large Finite Fields. G. Malle, Polynomials for Primitive Nonsolvable Permutation Groups of Degree d15. B.H. Matzat and A. Zeh-Marschke, Polynome mit der Galoisgruppe M11 ber (?). E. Maus, Computation of Integral Bases in Certain Sn Extensions of (?). A. Peth", On the Resolution of Thue Inequalities. W. Plesken, Towards a Soluble Quotient Algorithm. M. Pohst, A Modification of the LLL Reduction Algorithm. Bibliography of Hans Zassenhaus. Index.Pohst, Michael E. is the author of 'Algorithmic Methods in Algebra and Number Theory', published 1988 under ISBN 9780125591904 and ISBN 012559190X.