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
  Browse All Reviews > Computing Methodologies (I) > Symbolic and Algebraic Manipulation (I.1) > Expressions And Their Representation (I.1.1)  
 
Options:
 
  1-10 of 16 Reviews about "Expressions And Their Representation (I.1.1)": Date Reviewed
   Automated simplification of large symbolic expressions
Bailey D., Borwein J., Kaiser A. Journal of Symbolic Computation 60120-136, 2014.  Type: Article

The simplification of algebraic expressions is one of the major uses of any computer algebra system, and yet there is a paucity of material on the fundamental algorithms that underlie simplification. Such papers that exist tend to be q...

Nov 19 2014
  Computer algebra in quantum field theory: integration, summation and special functions
Schneider C., Blümlein J., Springer Publishing Company, Incorporated, New York, NY, 2013. 450 pp.  Type: Book (978-3-709116-15-9)

This book is all it says in the title, and indeed rather more. It is a collection of papers that grew out of a summer school course on integration, summation, and special functions in quantum field theory, run by the editors’...

Apr 28 2014
  A separation bound for real algebraic expressions
Burnikel C., Funke S., Mehlhorn K., Schirra S., Schmitt S. Algorithmica 55(1): 14-28, 2009.  Type: Article

This paper is concerned with separation bounds--how small can a nonzero number defined by a certain kind of expression be? Put another way, how accurate do we need to be to answer with positive, negative, or zero? Such questio...

Apr 5 2010
  Understanding expression simplification
Carette J.  Symbolic and algebraic computation (Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, Santander, Spain, Jul 4-7, 2004) 72-79, 2004.  Type: Proceedings

This rather informal paper addresses an important problem in computer algebra systems (CAS): “Which of many possible representations of a result, typically a mathematical expression, should be delivered as the answer?R...

Dec 3 2004
  Gröbner bases for complete uniform families
Hegedűs G., Rónyai L. Journal of Algebraic Combinatorics: An International Journal 17(2): 171-180, 2003.  Type: Article

In this paper, the authors present a completely explicit description of reduced Gröbner bases of the ideal of polynomials, which vanish on the set of characteristic vectors of the family of all d element sub...

May 5 2004
  Elimination methods
Wang D., Springer-Verlag New York, Inc., Secaucus, NJ, 2001. 244 pp.  Type: Book (9783211832417)

“The development of polynomial-elimination techniques from classical theory to modern algorithms has undergone a tortuous and rugged path. This can be observed from B.L. van der Waerden’s elimination of ...
Jan 1 2002
  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
  Subresultants under composition
Hong H. Journal of Symbolic Computation 23(4): 355-365, 1997.  Type: Article

Let A and B denote polynomials of degrees m and n in a variable x over an integral domain D. As usual, if M = M<...

Apr 1 1998
  Symbolic computation of derivations using labelled trees
Grossman R., Larson R. Journal of Symbolic Computation 13(5): 511-523, 1992.  Type: Article

It is well known that symbolic computation of derivations often leads to expressions of which some terms cancel in the end. The authors start with an example: a third-order differential operator the naïve computation of which ...

Feb 1 1994
  Multivariate polynomials, standard tableaux, and representations of symmetric groups
Clausen M. (ed) Journal of Symbolic Computation 11(5-6): 483-522, 1991.  Type: Article

The problem of finding appropriate bases for the free module of polynomials in countably many indeterminates with coefficients in a given commutative ring R (even when restricted to the special case of R being the ring of...

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