|
| Table of Contents
For full text in
Arithmetic and factorization of polynomial over
Joachim von zur Gathen and Jürgen Gerhard
Pages 1 - 9
Factoring modular polynomials (extended abstract)
Joachim von zur Gathen and Silke Hartlieb
Pages 10 - 17
Parallel distinct degree factorization algorithm
Tetsuro Fujise and Hirokazu Murao
Pages 18 - 25
Computing the complexification of a semi-algebraic set
Marie-Françoise Roy and Nicolai Vorobjov
Pages 26 - 34
Approximate polynomial greatest common divisors and nearest singular polynomials
N. Karmarkar and Y. N. Lakshman
Pages 35 - 39
The Euclidean algorithm in dimension
Loïc Pottier
Pages 40 - 42
Fast computations in the lattice of polynomial rational function fields
Franz Binder
Pages 43 - 48
Testing shift-equivalence of polynomials using quantum machines
D. Grigoriev
Pages 49 - 54
An optimal algorithm for constructing the reduced Gro¨bner basis of binomial ideals
Ulla Koppenhagen and Ernst W. Mayr
Pages 55 - 62
Exponential space computation of Gro¨bner bases
Klaus Kühnle and Ernst W. Mayr
Pages 63 - 71
Multigraded Hilbert functions and Buchberger algorithm
Massimo Caboara, Gabriel de Dominicis and Lorenzo Robbiano
Pages 72 - 78
Groebner basis under composition II
Hoon Hong
Pages 79 - 85
Symbolic mathematics system evaluators (extended abstract)
Richard J. Fateman
Pages 86 - 94
A case study of multi-threaded Gro¨bner basis completion
Beatrice Amrhein, Oliver Gloor and Wolfgang Küchlin
Pages 95 - 102
MPP: a framework for distributed polynomial computations
Olaf Bachmann, Hans Schönemann and Simon Gray
Pages 103 - 112
Memory tracing of algebraic calculations
Arthur Norman and John Fitch
Pages 113 - 119
Solution of elementary systems of equations in a box in
Daniel Richardson
Pages 120 - 126
Analysis of zero clusters in multivariate polynomial systems
Hans J. Stetter
Pages 127 - 136
A tangent-secant method for polynomial complex root calculation
George E. Collins and Werner Krandick
Pages 137 - 141
Fast high-precision computation of complex square roots
Timm Ahrendt
Pages 142 - 149
Computing character tables of
Andreas Thümmel
Pages 150 - 154
New sequential and parallel algorithms for generating high dimension Hecke algebras using the condensation technique
Gene Cooperman and Michael Tselman
Pages 155 - 160
Algorithms for primitive elements of free Lie algebras and Lie superalgebras
Alexander A. Mikhalev and Andrej A. Zolotykh
Pages 161 - 169
Efficient decomposition of associative algebras
W. Eberly and M. Giesbrecht
Pages 170 - 178
Janet bases of 2nd order ordinary differential equations
Fritz Schwarz
Pages 179 - 188
The general solution of an ordinary differential equation
Evelyne Hubert
Pages 189 - 195
Symbolic computation of the index of quasilinear differential-algebraic equations
G. Thomas
Pages 196 - 203
MapleTensor: progress report on a new system for performing indicial and component tensor calculations using symbolic computation
Masoud Kavian, R. G. McLenaghan and K. O. Geddes
Pages 204 - 211
Differentially homogeneous differential polynomials
Georg M. Reinhart and William Sit
Pages 212 - 218
Rational solutions of the mixed differential equation and its application to factorization of differential operators
Mark van Hoeij
Pages 219 - 225
An algorithm for complete enumeration of all factorizations of a linear ordinary differential operator
S. P. Tsarev
Pages 226 - 231
D'Alembertian solutions of inhomogeneous linear equations (differential, difference, and some other)
Sergei A. Abramov and Eugene V. Zima
Pages 232 - 240
On rank properties of Toeplitz matrices over finite fields
E. Kaltofen and A. Lobo
Pages 241 - 249
Computing Popov and Hermite forms of polynomial matrices
G. Villard
Pages 250 - 258
Asymptotically fast computation of Hermite normal forms of integer matrices
Arne Storjohann and George Labahn
Pages 259 - 266
Near optimal algorithms for computing Smith normal forms of integer matrices
Arne Storjohann
Pages 267 - 274
Generic Gram-Schmidt orthogonalization by exact division
Úlfar Erlingsson, Erich Kaltofen and David Musser
Pages 275 - 282
Automatic generation of optimization code based on symbolic non-linear domain formulation
Rainer Bacher
Pages 283 - 291
A methodology of parsing mathematical notation for mathematical computation
Yanjie Zhao, Tetsuya Sakurai, Hiroshi Sugiura and Tatsuo Torii
Pages 292 - 300
Hypergeometric function representations
Kelly Roach
Pages 301 - 308
Asymptotic expansions of exp-log functions
Daniel Richardson, Bruno Salvy, John Shackell and Joris Van der Hoeven
Pages 309 - 313
|
|
For full text in
|
The Digital Library is published by the Association for Computing Machinery. Copyright © 1999 ACM, Inc. | ||