Popular computer algebra systems such as Maple, Macsyma, Mathematica, and REDUCE are now basic tools on most computers. Efficient algorithms for various algebraic operations underlie all these systems. Computer algebra, or algorithmic algebra, studies these algorithms and their properties and represents a rich intersection of theoretical computer science with classical mathematics. Fundamental Problems of Algorithmic Algebra provides a systematic and focused treatment of a collection of core problemsthe computational equivalents of the classical Fundamental Problem of Algebra and its derivatives. Topics covered include the GCD, subresultants, modular techniques, the fundamental theorem of algebra, roots of polynomials, Sturm theory, Gaussian lattice reduction, lattices and polynomial factorization, linear systems, elimination theory, Grobner bases, and more. Features · Presents algorithmic ideas in pseudo-code based on mathematical concepts and can be used with any computer mathematics system · Emphasizes the algorithmic aspects of problems without sacrificing mathematical rigor · Aims to be self-contained in its mathematical development · Ideal for a first course in algorithmic or computer algebra for advanced undergraduates or beginning graduate students
The text is written for theoretical computer science students who would like to do research or understand the algorithmic underpinning of various commercial symbolic computations systems such as Mathematica, Maple, or Axiom.
This is the first graduate textbook on the algorithmic aspects of real algebraic geometry.
This book contains 22 lectures presented at the final conference of the Ger man research program (Schwerpunktprogramm) Algorithmic Number The ory and Algebra 1991-1997, sponsored by the Deutsche Forschungsgemein schaft.
This book still remains the best introduction to computer algebra, catering to both the interested beginner and the experienced pure mathematician and computer scientist. This updated Second Edition provides a...
primitive. permutation. groups. of. degree. less. than. 1000. Colva M. Roney-Dougal and William R. Unger School of ... into GAP by Theißen, along with the primitive groups of degree less than 256 having soluble socles [24, 26].
The algorithmic solution of problems has always been one of the major concerns of mathematics.
G.L. Miller, V. Ramachandran, E. Kaltofen, Efficient Parallel Evaluation of Straight-line Code and Arithmetic Circuits, SIAM J. Comput., 17, 4,687–695, 1988. Y. Mansour, B. Scheiber, P. Tiwari, Lower Bounds for Integer Greatest Common ...
This book covers most fundamental numerical and algebraic computations with Toeplitz, Hankel, Vandermonde, Cauchy, and other popular structured matrices.
This book deals with several topics in algebra useful for computer science applications and the symbolic treatment of algebraic problems, pointing out and discussing their algorithmic nature.
From the reviews of the hardcover edition: "... Many parts of the book can be read by anyone with a basic abstract algebra course.