ACM Digital Library: Proceedings of the 1998 international symposium on Symbolic and algebraic computation

| International Conference on Symbolic and Algebraic Computation
| Proceedings of the 1998 international symposium on Symbolic and algebraic computation August 13 - 15, 1998, Rostock Germany

| Table of Contents For full text in , use Adobe Acrobat Reader. An analysis of cancellation error in multivariate Hensel construction with floating-point number arithmetic Tateaki Sasaki and Satoshi Yamaguchi Pages 1 - 8
metadata: |  |  |  |  |  |
full text: |  | 283 KB
Singular systems of polynomials Hans J. Stetter and Günther H. Thallinger Pages 9 - 16
metadata: |  |  |  |  |  |
full text: |  | 257 KB
Polytime algorithm for the shortest path in a homotopy class amidst semi-algebraic obstacles in the plane D. Grigoriev and A. Slissenko Pages 17 - 24
metadata: |  |  |  |  |  |
full text: |  | 275 KB
Complexity of computing semi-algebraic descriptions of the connected components of a semi-algebraic set Saugata Basu, Richard Pollack and Marie-Françoise Roy Pages 25 - 29
metadata: |  |  |  |  |  |
full text: |  | 219 KB
FOXBOX: a system for manipulating symbolic objects in black box representation Angel Díaz and Erich Kaltofen Pages 30 - 37
metadata: |  |  |  |  |  |
full text: |  | 193 KB
The GAP 4 type system: organising algebraic algorithms Thomas Breuer and Steve Linton Pages 38 - 45
metadata: |  |  |  |  |  |
full text: |  | 214 KB
Software components using symbolic computation for problem solving environments Y. N. Lakshman, Bruce Char and Jeremy Johnson Pages 46 - 53
metadata: |  |  |  |  |  |
full text: |  | 312 KB
Coordinating mathematical content and presentation markup in interactive mathematical documents Samuel S. Dooley Pages 54 - 61
metadata: |  |  |  |  |  |
full text: |  | 241 KB
Software components for computer algebra Pietro Iglio and Giuseppe Attardi Pages 62 - 69
metadata: |  |  |  |  |  |
full text: |  | 222 KB
Compound program packages and a nonlinear random fluctuations analysis Igor E. Poloskov Pages 70 - 75
metadata: |  |  |  |  |  |
full text: |  | 221 KB
Application of computer algebra methods to the construction of an asteroid motion theory based on Lie transforms Akmal A. Vakhidov and Irina V. Tupikova Pages 76 - 79
metadata: |  |  |  |  |  |
full text: |  | 186 KB
Lightweight formal methods for computer algebra systems Martin Dunstan, Tom Kelsey, Steve Linton and Ursula Martin Pages 80 - 87
metadata: |  |  |  |  |  |
full text: |  | 274 KB
Approaches to parallel quantifier elimination Andreas Dolzmann, Oliver Gloor and Thomas Sturm Pages 88 - 95
metadata: |  |  |  |  |  |
full text: |  | 244 KB
On bivariate Hensel and its parallelization Laurent Bernardin Pages 96 - 100
metadata: |  |  |  |  |  |
full text: |  | 201 KB
An O(n 3) algorithm for the Frobenius normal form Arne Storjohann Pages 101 - 105
metadata: |  |  |  |  |  |
full text: |  | 201 KB
The modulo N extended GCD problem for polynomials Thom Mulders and Arne Storjohann Pages 105 - 112
metadata: |  |  |  |  |  |
full text: |  | 294 KB
Certifying inconsistency of sparse linear systems M. Giesbrecht, A. Lobo and B. D. Saunders Pages 113 - 119
metadata: |  |  |  |  |  |
full text: |  | 298 KB
Rational solutions of linear difference equations Mark van Hoeij Pages 120 - 123
metadata: |  |  |  |  |  |
full text: |  | 176 KB
Rational solutions of first order linear difference systems S. A. Abramov and M. A. Barkatou Pages 124 - 131
metadata: |  |  |  |  |  |
full text: |  | 274 KB
A subresultant theory for Ore polynomials with applications Ziming Li Pages 132 - 139
metadata: |  |  |  |  |  |
full text: |  | 252 KB
Canonical subalgebraic bases in non-commutative polynomial rings Patrik Nordbeck Pages 140 - 146
metadata: |  |  |  |  |  |
full text: |  | 257 KB
Efficient algorithms for ideal operations (extended abstract) Massimo Caboara and Carlo Traverso Pages 147 - 152
metadata: |  |  |  |  |  |
full text: |  | 215 KB
Deciding linear disjointness of finitely generated fields Jörn Müller-Quade and Martin Rötteler Pages 153 - 160
metadata: |  |  |  |  |  |
full text: |  | 287 KB
Covering monomial algebras R. Nörenberg Pages 161 - 164
metadata: |  |  |  |  |  |
full text: |  | 182 KB
Fast multiplication and growth in groups Charles C. Sims Pages 165 - 170
metadata: |  |  |  |  |  |
full text: |  | 208 KB
A note on Nielsen reduction and coset enumeration Birgit Reinert, Klaus Madlener and Teo Mora Pages 171 - 178
metadata: |  |  |  |  |  |
full text: |  | 278 KB
The 5-modular decomposition matrix of the sporadic simple Conway group Co 3 Jürgen Müller Pages 179 - 185
metadata: |  |  |  |  |  |
full text: |  | 258 KB
Solving puzzles related to permutation groups Sebastian Egner and Markus Püschel Pages 186 - 193
metadata: |  |  |  |  |  |
full text: |  | 414 KB
Computing normal subgroups Alexander Hulpke Pages 194 - 198
metadata: |  |  |  |  |  |
full text: |  | 206 KB
Multidimensional chains of recurrences V. Kislenkov, V. Mitrofanov and E. Zima Pages 199 - 206
metadata: |  |  |  |  |  |
full text: |  | 300 KB
Simplication of symbolic-numerical interval expressions E. D. Popova and C. P. Ullrich Pages 207 - 214
metadata: |  |  |  |  |  |
full text: |  | 294 KB
Solving one and two-dimensional exponential polynomial systems Aude Maignan Pages 215 - 221
metadata: |  |  |  |  |  |
full text: |  | 239 KB
Solving "generalized algebraic equations" Frédéric Beringer and Françoise Jung Pages 222 - 227
metadata: |  |  |  |  |  |
full text: |  | 242 KB
Optimization strategies for the approximate GCD problem Paulina Chin, Robert M. Corless and George F. Corliss Pages 228 - 235
metadata: |  |  |  |  |  |
full text: |  | 263 KB
Efficient algorithms for computing the nearest polynomial with constrained roots Markus A. Hitz and Erich Kaltofen Pages 236 - 243
metadata: |  |  |  |  |  |
full text: |  | 270 KB
MARS: a MAPLE/MATLAB/C resultant-based solver Aaron Wallack, Ioannis Z. Emiris and Dinesh Manocha Pages 244 - 251
metadata: |  |  |  |  |  |
full text: |  | 322 KB
Controlled iterative methods for solving polynomial systems Didier Bondyfalat, Bernard Mourrain and Victor Y. Pan Pages 252 - 259
metadata: |  |  |  |  |  |
full text: |  | 370 KB
Fast numerical improvement of factors of polynomials and of partial fractions Peter Kirrinnis Pages 260 - 267
metadata: |  |  |  |  |  |
full text: |  | 299 KB
On the equivalence problem of linear differential systems and its application for factoring completely reducible systems M. A. Barkatou and E. Pflügel Pages 268 - 275
metadata: |  |  |  |  |  |
full text: |  | 303 KB
Computation of the monodromy of generalized polylogarithms Hoang Ngoc Minh, Michel Petitot and Joris Van Der Hoeven Pages 276 - 283
metadata: |  |  |  |  |  |
full text: |  | 272 KB
High degree solutions of low degree equations (extended abstract) Jürgen Gerhard Pages 284 - 289
metadata: |  |  |  |  |  |
full text: |  | 228 KB
Recursive integration of piecewise-continuous functions D. J. Jeffrey and A. D. Rich Pages 290 - 294
metadata: |  |  |  |  |  |
full text: |  | 199 KB
Simplification of truth-invariant cylindrical algebraic decompositions Christopher W. Brown Pages 295 - 301
metadata: |  |  |  |  |  |
full text: |  | 288 KB
Rational parametrization of real algebraic surfaces Josef Schicho Pages 302 - 308
metadata: |  |  |  |  |  |
full text: |  | 226 KB
Monomial representations for Gro¨bner bases computations Olaf Bachmann and Hans Schönemann Pages 309 - 316
metadata: |  |  |  |  |  |
full text: |  | 293 KB
A new type of canonical Gro¨bner bases in polynomial rings over Von Neumann regular rings Yosuke Sato Pages 317 - 321
metadata: |  |  |  |  |  |
full text: |  | 210 KB

| For full text in , use Adobe Acrobat Reader.

|  | The Digital Library is published by the Association for Computing Machinery. Copyright © 1999 ACM, Inc.