| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 17
reviews
|
|
|
 |
|
|
|
|
How to think about algorithms
Edmonds J., Cambridge University Press, New York, NY, 2008. 472 pp. Type: Book (9780521614108), Reviews: (1 of 2)
This book is, by design, not a replacement for the standard algorithms texts that are in wide use for undergraduate college courses. Rather, it aims to be an inexpensive supplement to aid students (and probably the instructors in those...
|
Aug 14 2008 |
|
|
|
|
|
|
A Java API for polynomial arithmetic
Whelan C., Duffy A., Burnett A., Dowling T. Principles and practice of programming in Java (Proceedings of the 2nd International Conference on Principles and Practice of Programming in Java, Kilkenny City, Ireland, Jun 16-18, 2003) 139-144, 2003. Type: Proceedings
The authors exhibit a design for a Java application programming interface (API) for polynomials in one variable with “BigInteger” coefficients. There is no evidence that the design has been implemented. Ther...
|
Jun 6 2005 |
|
|
|
|
|
|
Automated scientific software scripting with SWIG
Beazley D. Future Generation Computer Systems 19(5): 599-609, 2003. Type: Article
Scientific programmers building large systems sometimes use scripting languages to glue together parts of their applications, most of which are written in a batch language, like C. The author and his team contend that writing interface...
|
Nov 4 2003 |
|
|
|
|
|
|
Equality in computer algebra and beyond
Davenport J. Journal of Symbolic Computation 34(4): 259-270, 2002. Type: Article
The author points out the mostly obvious consequences of the fact that equality in mathematics is used in a variety of ways. As such, equality is not trivially mapped into the various representations of mathematical notions as data str...
|
Jun 11 2003 |
|
|
|
|
|
|
A parser for the interval evaluation of analytical functions and its application to engineering problems
Merlet J. Journal of Symbolic Computation 31(4): 475-486, 2001. Type: Article
A more appropriate title for this paper would have been “An elementary computation of robot trajectory using interval arithmetic.” The parser mentioned in the title appears to be comparable to a one- or two-week exe...
|
Jun 14 2002 |
|
|
|
|
|
|
Fundamental problems of algorithmic algebra
Yap C., Oxford University Press, Inc., New York, NY, 2000. 511 pp. Type: Book (9780195125160)
The objective of this text is to elaborate on the themes of three fundamental problems in the modern mathematical and algorithm-analysis foundations for constructive exact mathematical computation (computer algebra). These problems are...
|
Mar 1 2000 |
|
|
|
|
|
|
Modern computer algebra
von zur Gathen J. (ed), Gerhard J., Cambridge University Press, New York, NY, 1999. Type: Book (9780521641760)
The objective of this text is to lay out the modern mathematical and algorithm analysis foundations for constructive exact mathematical computation (computer algebra). The authors emphasize much of the now well-understood mathematical ...
|
Oct 1 1999 |
|
|
|
|
|
|
Using the Magma computer algebra system in abstract algebra courses
Cannon J. (ed), Playoust C. Journal of Symbolic Computation 23(5-6): 459-484, 1997. Type: Article
The authors claim that their new Magma (Cayley version 4) computer algebra system has a syntax and semantics that should make it an especially appropriate tool for teaching abstract algebra. Here they describe experiments in a course a...
|
Jun 1 1998 |
|
|
|
|
|
|
The MAGMA algebra system I
Bosma W. (ed), Cannon J. (ed), Playoust C. Journal of Symbolic Computation 24(3-4): 235-265, 1997. Type: Article
Magma is the latest interactive computer system to be released by the Computational Algebra Group of the School of Mathematics and Statistics at the University of Sydney, Australia. The authors describe the system design as of 1996, in...
|
Jun 1 1998 |
|
|
|
|
|
|
Improvement of the degree setting in Gosper’s algorithm
Lisoněk P., Paule P. (ed), Strehl V. (ed) Journal of Symbolic Computation 16(3): 243-258, 1993. Type: Article
The improved degree bound for Gosper’s indefinite summation algorithm applies only when the sequence to be summed is of the restricted case of rational functions. The authors conjecture that a benefit of their technique is th...
|
May 1 1995 |
|
|
|
|
|
| |
|
|
| |
|
|
