yap at cs.nyu.edu
Wed Jan 12 10:48:13 PST 2000
Announcing a new book:
Fundamental Problems of Algorithmic Algebra
by CHEE YAP, New York University
Oxford University Press, 2000.
Oxford University Press Announcement:
Table of Contents:
511 pp.; 22 line illus; 7-1/2 x 9-1/4; 0-19-512516-9; $72 (US)
Computer Algebra systems represents a rapidly growing application of
computer science to all areas of scientific research and computation.
Well-known computer algebra systems such as Maple, Macsyma, Mathematica
and REDUCE are now a basic tool on most computers.
Underlying these systems are efficient algorithms for various algebraic
operations. The field of Computer Algebra, or Algorithmic Algebra,
constitute the study of these algorithms and their properties,
and represents a rich intersection of theoretical computer science with
very classical mathematics. For researchers in computational geometry,
computer algebra offers the necessary tools in the investigation
of nonlinear problems and issues of current interest such as
non-robustness in geometric algorithms.
Yap's book focuses on a collection of core problems in this area;
in effect, they are the computational versions of the classical
Fundamental Problem of Algebra and its derivatives.
It attempts to be self-contained in its mathematical development
while addressing the algorithmic aspects of problems.
The book is intended for a first course in algorithmic algebra
(or computer algebra) for advanced undergraduates or beginning
graduate students in computer science.
Additionally, it will be a useful reference for professionals
in this field. Excellent presentation of mathematics relevant to
The compgeom mailing lists: see
or send mail to compgeom-request at research.bell-labs.com with the line:
Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html.
More information about the Compgeom-announce