 |  | |||||
|
| |||||||||
|
 |
 |
 |
 |
 |
|
Table of Contents
For full text in
 , use Adobe Acrobat Reader.
On algebraic solutions of first order Riccatti equation
Alexey Zharkov
Pages 1 - 3
A rationality result for Kovacic's algorithm
Marius van der Put and Peter A. Hendriks
Pages 4 - 8
A probabilistic symbolic-numerical method for the stability analyses of difference schemes for PDEs
V. G. Ganzha and E. V. Vorozhtsov
Pages 9 - 13
Computer generation of normalizing transformation for systems of nonlinear ODE
Victor F. Edneral
Pages 14 - 19
On d'Alembert substitution
S. A. Abramov
Pages 20 - 26
Finding all hypergeometric solutions of linear differential equations
Marko Petkovšek and Bruno Salvy
Pages 27 - 33
Integration to obtain expressions valid on domains of maximum extent
D. J. Jeffrey
Pages 34 - 41
Numeric code optimization in computer algebra systems and recurrent relations technique
E. V. Zima
Pages 42 - 46
A hybrid method for high precision calculation of polynomial real roots
George E. Collins and Werner Krandick
Pages 47 - 52
Symbolic evaluation in the nonlinear mechanical systems
D. M. Klimov, V. M. Rudenko and V. V. Leonov
Pages 53 - 54
Parallelizing programs with APs
A. B. Godlevsky and A. E. Doroshenko
Pages 55 - 62
Application of computer algebra to investigation of the relative equilibria of a satellite
S. A. Gutnik
Pages 63 - 64
Studies of regular precessions of a symmetric satellite by means of computer algebra
Ivan I. Shevchenko and Andrej G. Sokolsky
Pages 65 - 67
GRADIENT: algorithmic differentiation in Maple
Michael B. Monagan and Walter M. Neuenschwander
Pages 68 - 76
A type system for computer algebra (abstract)
Phillip S. Santas
Page 77
The regular problem and green equivalences for special monoids
Jinzhao Wu and Lian Li
Pages 78 - 85
Decomposition of *-closed algebras in polynomial time
László Babai, Katalin Friedl and Markus Stricker
Pages 86 - 94
On the assignment complexity of uniform trees
Hongzhong Wu
Pages 95 - 104
Decision procedures for stratified set-theoretic syllogistics
Domenico Cantone and Vincenzo Cutello
Pages 105 - 110
A generalization of the binary GCD algorithm
T. Jebelean
Pages 111 - 116
Deciding finiteness of matrix groups in deterministic polynomial time
László Babai, Robert Beals and Daniel Rockmore
Pages 117 - 126
An elementary algorithm for computing the composition factors of a permutation group
Robert Beals
Pages 127 - 134
Aspect graphs of algebraic surfaces
Marie-Françoise Roy
Pages 135 - 143
A zero structure theorem for exponential polynomials
Daniel Richardson
Pages 144 - 151
On the greatest common divisor of polynomials which depend on a parameter
S. A. Abramov and K. Yu. Kvashenko
Pages 152 - 156
Full partial fraction decomposition of rational functions
Manuel Bronstein and Bruno Salvy
Pages 157 - 160
An upper bound on the number of monomials in the Sylvester resultant
Michael Kalkbrener
Pages 161 - 163
Noether's S-transformation simplifies curve singularities rationally: a local analysis
Emil J. Volcheck
Pages 164 - 172
The 40 "generic" positions of a parallel robot
B. Mourrain
Pages 173 - 182
A practical method for the sparse resultant
Ioannis Emiris and John Canny
Pages 183 - 192
Parallel computations with Toeplitz-like and Hankel-like matrices
Dario Bini and Victor Pan
Pages 193 - 200
Efficient algorithms for Hankel matrices over Z[x1,...,xr]
Juan R. Sendra and Juan Llovet
Pages 201 - 208
Computation of the Smith normal form of polynomial matrices
Gilles Villard
Pages 209 - 217
On Hensel construction of eigenvalues and eigenvectors of matrices with polynomial entries
Kazuhiro Yokoyama and Taku Takeshima
Pages 218 - 224
An algorithm for the computation of normal forms and invariant manifolds
L. Vallier
Pages 225 - 233
Nested expansions and hardy fields
John Shackell
Pages 234 - 238
A new algorithm for computing asymptotic series
Dominik Gruntz
Pages 239 - 244
Differential term-orders
Volker Weispfenning
Pages 245 - 253
Computing Gro¨bner bases in monoid and group rings
Klaus Madlener and Birgit Reinert
Pages 254 - 263
Quantifier elimination for formulas constrained by quadratic equations
Hoon Hong
Pages 264 - 274
A dynamic algorithm for Gro¨bner basis computation
Massimo Caboara
Pages 275 - 283
Automated geometry theorem proving by vector calculation
Shang-Ching Chou, Xiao-Shan Gao and Jing-Zhong Zhang
Pages 284 - 291
Some results on theorem proving in geometry over finite fields
Dongdai Lin and Zhuojun Liu
Pages 292 - 300
Geometry theorem proving in vector spaces by means of Gro¨bner bases
Sabine Stifter
Pages 301 - 310
An application of IRENA to systems of nonlinear equations arising in equilibrium flows in networks.
G. Keady and M. G. Richardson
Pages 311 - 320
|
|
For full text in
, use Adobe Acrobat Reader. |
|
|
The Digital Library is published by the Association for Computing Machinery. Copyright © 1999 ACM, Inc. |
|
      
| |
