Abstract is missing.
- Who was who in polynomial factorization: 1Joachim von zur Gathen. 2 [doi]
- Computational communicative algebraHennie Poulisse. 3-4 [doi]
- Group-theoretic algorithms for matrix multiplicationChristopher Umans. 5 [doi]
- CoCoA: a system for computations in commutative algebraAnna Maria Bigatti, Lorenzo Robbiano. 6 [doi]
- Hybrid symbolic-numeric computationErich Kaltofen, Lihong Zhi. 7 [doi]
- Triangular decompositions of polynomial systems: from theory to practiceMarc Moreno Maza. 8 [doi]
- Implementation of Kumar s correspondenceHirotachi Abo, Chris Peterson. 9-16 [doi]
- On the summation of P-recursive sequencesSergei A. Abramov. 17-22 [doi]
- Symbolic computation of multidimensional Fenchel conjugatesJonathan M. Borwein, Chris H. Hamilton. 23-30 [doi]
- Low complexity algorithms for linear recurrencesAlin Bostan, Frédéric Chyzak, Bruno Salvy, Thomas Cluzeau. 31-38 [doi]
- Application of high-precision computing for pricing arithmetic asian optionsPhelim Boyle, Alex Potapchik. 39-46 [doi]
- On computing polynomial GCDs in alternate basesHoward Cheng, George Labahn. 47-54 [doi]
- Conditions for determinantal formula for resultant of a polynomial systemArthur D. Chtcherba, Deepak Kapur. 55-62 [doi]
- Solving sparse rational linear systemsWayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard. 63-70 [doi]
- Almost tight recursion tree bounds for the Descartes methodArno Eigenwillig, Vikram Sharma, Chee-Keng Yap. 71-78 [doi]
- Symbolic numeric analysis of attractors in randomly generated piecewise affine models of gene networksEtienne Farcot. 79-86 [doi]
- Succinct representation of finite abelian groupsArash Farzan, J. Ian Munro. 87-92 [doi]
- Implementation techniques for fast polynomial arithmetic in a high-level programming environmentAkpodigha Filatei, Xin Li, Marc Moreno Maza, Éric Schost. 93-100 [doi]
- Resolvent systems of difference polynomial idealsXiao-Shan Gao, Chun-Ming Yuan. 101-108 [doi]
- Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithmPierrick Gaudry, François Morain. 109-115 [doi]
- Symbolic-numeric sparse interpolation of multivariate polynomialsMark Giesbrecht, George Labahn, Wen-shin Lee. 116-123 [doi]
- Enumeration of Rota-Baxter wordsLi Guo, William Y. Sit. 124-131 [doi]
- Rational parametrisation for degree 6 Del Pezzo surfaces using lie algebrasMichael Harrison, Josef Schicho. 132-137 [doi]
- Effective real numbers in MmxlibJoris van der Hoeven. 138-145 [doi]
- Approximate radical of ideals with clusters of rootsItnuit Janovitz-Freireich, Lajos Rónyai, Ágnes Szántó. 146-153 [doi]
- High-performance implementations of the Descartes methodJeremy R. Johnson, Werner Krandick, Kevin Lynch, David G. Richardson, Anatole D. Ruslanov. 154-161 [doi]
- Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fieldsErich Kaltofen, Pascal Koiran. 162-168 [doi]
- Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomialsErich Kaltofen, Zhengfeng Yang, Lihong Zhi. 169-176 [doi]
- Application of unspecified sequences in symbolic summationManuel Kauers, Carsten Schneider. 177-183 [doi]
- Fast rational function reconstructionSara Khodadad, Michael B. Monagan. 184-190 [doi]
- An algorithm for the computation of the radical of an idealSantiago Laplagne. 191-195 [doi]
- Solving Kaltofen s challenge on Zolotarev s approximation problemDaniel Lazard. 196-203 [doi]
- Rank reduction of a class of pfaffian systems in two variablesNicolas Le Roux, Moulay A. Barkatou. 204-211 [doi]
- Intersection of ideals with non-commutative subalgebrasViktor Levandovskyy. 212-219 [doi]
- A recursive method for determining the one-dimensional submodules of Laurent-Ore modulesZiming Li, Michael F. Singer, Min Wu, Dabin Zheng. 220-227 [doi]
- Resultants of skewly composed polynomialsManfred Minimair. 228-233 [doi]
- An improvement of GAP normalizer function for permutation groupsIzumi Miyamoto. 234-238 [doi]
- Rational simplification modulo a polynomial idealMichael B. Monagan, Roman Pearce. 239-245 [doi]
- Complexity of the resolution of parametric systems of polynomial equations and inequationsGuillaume Moroz. 246-253 [doi]
- A data structure for a uniform approach to computations with finite groupsMax Neunhöffer, Ákos Seress. 254-261 [doi]
- Modular dynamic evaluationMasayuki Noro. 262-268 [doi]
- Uniform Gröbner bases for ideals generated by polynomials with parametric exponentsWei Pan, Dongming Wang. 269-276 [doi]
- Change of order for bivariate triangular setsCyril Pascal, Éric Schost. 277-284 [doi]
- A quantitative Pólya s Theorem with corner zerosVictoria Powers, Bruce Reznick. 285-289 [doi]
- Computation of the splitting field of a dihedral polynomialGuénaël Renault. 290-297 [doi]
- A parallel architecture for disk-based computing over the Baby Monster and other large finite simple groupsEric Robinson, Gene Cooperman. 298-305 [doi]
- A note on implicitization and normal parametrization of rational curvesRosario Rubio, J. Miguel Serradilla, M. Pilar Vélez. 306-309 [doi]
- Locating real multiple zeros of a real interval polynomialHiroshi Sekigawa, Kiyoshi Shirayanagi. 310-317 [doi]
- Abstract matrices in symbolic computationAlan P. Sexton, Volker Sorge. 318-325 [doi]
- A simple algorithm to compute comprehensive Gröbner bases using Gröbner basesAkira Suzuki, Yosuke Sato. 326-331 [doi]
- A block Wiedemann rank algorithmWilliam J. Turner. 332-339 [doi]
- Surface parametrisation without diagonalisationChristiaan van de Woestijne. 340-344 [doi]
- Application of numerical algebraic geometry and numerical linear algebra to PDEWenyuan Wu, Greg Reid. 345-352 [doi]
- Gröbner bases in difference-differential modulesMeng Zhou, Franz Winkler. 353-360 [doi]