|
| Table of Contents
For full text in
Solving some overdetermined polynomial systems
Marc Giusti and Éric Schost
Pages 1 - 8
A new algorithm for the geometric decomposition of a variety
Mohamed Elkadi and Bernard Mourrain
Pages 9 - 16
Base field restriction techniques for parametric curves
Carlos Andradas, Taomás Recio and J. Refael Sendra
Pages 17 - 22
On multiple zeros of systems of algebraic equations
Schuichi Moritsugu and Kazuko Kuriyama
Pages 23 - 30
Commutativity theorems: examples in search of algorithms
John J. Wavrik
Pages 31 - 36
Constructing bases of finitely presented Lie algebras using Gröbner bases in free algebras
W. A. de Graaf and J. Wisliceny
Pages 37 - 43
Efficient construction of Drinfel'd doubles
Gerard P. Brunick, Edward L. Green, Lenwood S. Heath and Craig A. Struble
Pages 45 - 52
Efficient computation of minimal polynomials in algebraic extensions of finite fields
Victor Shoup
Pages 53 - 58
On the genericity of the modular polynomial GCD algorithm
Erich Kaltofen and Michael B. Monagan
Pages 59 - 66
On feasible multivariate polynomial interpolations over arbitrary fields
Zeljko Zilic and Katarzyna Radecka
Pages 67 - 74
How fast can we compute products?
V. Kislenkov, V. Mitrofanov and E. Zima
Pages 75 - 82
Computing special powers in finite fields: extended abstract
Joachim von zur Gathen and Michael Nöcker
Pages 83 - 90
On sampling generating sets of finite groups and product replacement algorithm: extended abstract
Igor Pak and Sergey Bratus
Pages 91 - 96
Star products and the representation of asymptotic growth
John Shackell
Pages 97 - 104
Existence and uniqueness theorems for formal power series solutions of analytic differential systems
C. J. Rust, G. J. Reid and A. D. Wittkopf
Pages 105 - 112
Formal solutions of scalar singularly-perturbed linear differential equations
Y. O. Macutan
Pages 113 - 120
A reduction algorithm for matrices depending on a parameter
C.-P. Jeannerod and E. Pfl¨gel
Pages 121 - 128
Mixed real-integre linear quantifier elimination
Volker Weispfenning
Pages 129 - 136
Guaranteed solution formula construction
Christopher W. Brown
Pages 137 - 144
On projection in CAD-based quantifier elimination with equational constraint
Scott McCallum
Pages 145 - 149
P-adic constraint solving
Andreas Dolzmann and Thomas Sturm
Pages 151 - 158
On factorization of nonlinear ordinary differential equations
S. P. Tsarev
Pages 159 - 164
Rational normal form for dynamical systems by Carleman linearization
Guoting Chen and Jean Della Dora
Pages 165 - 172
Solving linear ordinary differential equations over
Manuel Bronstein and Anne Fredet
Pages 173 - 179
Diophantine linear system solving
Thom Mulders and Arne Storjohann
Pages 181 - 188
Shifted normal forms of polynomial matrices
Bernhard Beckermann, George Labahn and Gilles Villard
Pages 189 - 196
Fast deterministic computation of determinants of dense matrices
John Abbott, Manuel Bronstein and Thom Mulders
Pages 197 - 204
Efficient algorithms for computing the nearest polynomial with a real root and related problems
Markus A. Hitz, Erich Kaltofen and Y. N. Lakshman
Pages 205 - 212
Approximate polynomial decomposition
Robert M. Corless, Mark W. Giesbrecht and David J. Jeffrey
Pages 213 - 219
ADrien: an implementation of automatic differentiation in Maple
Dominique Villard and Michael B. Monagan
Pages 221 - 228
Automated coercion for axiom
Nicolas J. Doye
Pages 229 - 235
Symbolic computation in Java: an appraisement
Laurent Bernardin, Bruce Char and Erich Kaltofen
Pages 237 - 244
Specifying implementations
Laureano Lambán, Vico Pascual and Julio Rubio
Pages 245 - 251
Automated theorem proving in support of computer algebra: symbolic definite integration as a case study
A. A. Adams, H. Gottliebsen, S. A. Linton and U. Martin
Pages 253 - 260
About the polynomial solutions of homogeneous linear differential equations depending on parameters
Delphine Boucher
Pages 261 - 268
Desingularization of linear difference operators with polynomial coefficients
Sergei A. Abramov and Mark van Hoeij
Pages 269 - 275
Rational solutions of matrix difference equations: the problem of equivalence and factorization
M. A. Barkatou
Pages 277 - 282
Design of a customizable component to display and edit formulas
Olivier Arsac, St´phane Dalmas and Marc Gaétano
Pages 283 - 290
Design and protocol for Internet accessible mathematical computation
Paul S. Wang
Pages 291 - 298
Client-server communication standards for mathematical computation
Ha Le and Chris Howlett
Pages 299 - 306
|
|
For full text in
|
The Digital Library is published by the Association for Computing Machinery. Copyright © 1999 ACM, Inc. | ||