Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Monagan, Michael Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 3 of 3 reviews    
  POLY: a new polynomial data structure for Maple 17
Monagan M., Pearce R. ACM Communications in Computer Algebra 46(3/4): 164-167, 2012.  Type: Article

The title of this paper describes the content exactly. Maple did not previously have a dedicated data structure for polynomials; it stored them as general expressions, which were stored in a sum of products (SoP) representation. Since ...
...
Mar 17 2014  
  A heuristic irreducibility test for univariate polynomials
Monagan M. Journal of Symbolic Computation 13(1): 47-57, 1992.  Type: Article

The aim of this paper is to present an irreducibility criterion for univariate polynomials with integer coefficients. The method is based on the fact that, if the evaluation of the polynomial f at a well-chosen int...
...
Apr 1 1993  
  A tutorial introduction to Maple
Char B. (ed), Fee G., Geddes K., Gonnet G., Monagan M. Journal of Symbolic Computation 2(2): 179-200, 1986.  Type: Article

The Maple computer algebra system is described, with brief sample sessions given. The authors point out that Maple is distinguished from other computer algebra systems by its compactness, portability, and user extensibility. Currently,...
...
May 1 1987  

   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy