Abstract is missing.
- Applicability of Zeilberger s algorithm to hypergeometric termsSergei A. Abramov. 1-7 [doi]
- Fraction-free row reduction of matrices of skew polynomialsBernhard Beckermann, Howard Cheng, George Labahn. 8-15 [doi]
- Towards better simplification of elementary functionsRussell J. Bradford, James H. Davenport. 16-22 [doi]
- Solutions of linear ordinary differential equations in terms of special functionsManuel Bronstein, Sébastien Lafaille. 23-28 [doi]
- On the efficiency and optimality of Dixon-based resultant methodsArthur D. Chtcherba, Deepak Kapur. 29-36 [doi]
- A geometric-numeric algorithm for absolute factorization of multivariate polynomialsRobert M. Corless, André Galligo, Ilias S. Kotsireas, Stephen M. Watt. 37-45 [doi]
- Multihomogeneous resultant matricesAlicia Dickenstein, Ioannis Z. Emiris. 46-54 [doi]
- Editing mathematical content and presentation markup in interactive mathematical documentsSamuel S. Dooley. 55-62 [doi]
- Finite field linear algebra subroutinesJean-Guillaume Dumas, Thierry Gautier, Clément Pernet. 63-74 [doi]
- Partial solvability by radicalsPilar Fernandez-Ferreiros, Maria de los Angeles Gomez-Molleda, Laureano González-Vega. 84-91 [doi]
- Computing the topology of real algebraic surfacesElisabetta Fortuna, Patrizia M. Gianni, Paola Parenti, Carlo Traverso. 92-100 [doi]
- Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithmMark Giesbrecht, Erich Kaltofen, Wen-shin Lee. 101-108 [doi]
- A modular GCD algorithm over number fields presented with multiple extensionsMark van Hoeij, Michael B. Monagan. 109-116 [doi]
- A new zero-test for formal power seriesJoris van der Hoeven. 117-122 [doi]
- Sparsity issues in the computation of Jacobian matricesShahadat Hossain, Trond Steihaug. 123-130 [doi]
- A reduced form for perturbed matrix polynomialsClaude-Pierre Jeannerod. 131-137 [doi]
- An output-sensitive variant of the baby steps/giant steps determinant algorithmErich Kaltofen. 138-144 [doi]
- Determinantal formula for the chow form of a toric surfaceAmit Khetan. 145-150 [doi]
- Computation of canonical forms for ternary cubicsIrina A. Kogan, Marc Moreno Maza. 151-160 [doi]
- Simplification of definite sums of rational functions by creative symmetrizing methodHa Q. Le. 161-167 [doi]
- Factoring zero-dimensional ideals of linear partial differential operatorsZiming Li, Fritz Schwarz, Serguei P. Tsarev. 168-175 [doi]
- Polynomial-time normalizers for permutation groups with restricted composition factorsEugene M. Luks, Takunari Miyazaki. 176-183 [doi]
- The differential Hilbert function of a differential rational mapping can be computed in polynomial timeGuillermo Matera, Alexandre Sedoglavic. 184-191 [doi]
- Towards certified irreducibility testing of bivariate approximate polynomialsKosaku Nagasaka. 192-199 [doi]
- Yet another practical implementation of polynomial factorization over finite fieldsMasayuki Noro, Kazuhiro Yokoyama. 200-206 [doi]
- Acceleration of Euclidean algorithm and extensionsVictor Y. Pan, Xinmao Wang. 207-213 [doi]
- Some observations on familiar numbersDaniel Richardson, Simon Langley. 214-220 [doi]
- Towards faster real algebraic numbersRenaud Rioboo. 221-228 [doi]
- Simplification of surface parametrizationsJosef Schicho. 229-237 [doi]
- Degree bounds and lifting techniques for triangular setsÉric Schost. 238-245 [doi]
- High-order liftingArne Storjohann. 246-254 [doi]
- An alternative approach to comprehensive Gröbner basesAkira Suzuki, Yosuke Sato. 255-261 [doi]
- Numerical stability and stabilization of Groebner basis computationCarlo Traverso, Alberto Zanoni. 262-269 [doi]
- Canonical comprehensive Gröbner basesVolker Weispfenning. 270-276 [doi]