Table of Contents

• Sums of squares of polynomials and their applicationsPablo A. Parrilo. 1 [doi]
• Triangulations of polytopes and algebraic geometryFrancisco Santos. 2 [doi]
• Numerical algebraic geometry and symbolic computationJan Verschelde. 3 [doi]
• Factoring polynomials via polytopesFatima Abu Salem, Shuhong Gao, Alan G. B. Lauder. 4-11 [doi]
• Numerical parameterization of affine varieties usingD. A. Aruliah, Robert M. Corless. 12-18 [doi]
• Optimal descriptions of orbit spaces and strata of finite groupsThomas Bayer. 19-26 [doi]
• A poly-algorithmic approach to simplifying elementary functionsJames C. Beaumont, Russell J. Bradford, James H. Davenport, Nalina Phisanbut. 27-34 [doi]
• Efficient desingularization of reducible algebraic setsGábor Bodnár. 35-41 [doi]
• Complexity issues in bivariate polynomial factorizationAlin Bostan, Grégoire Lecerf, Bruno Salvy, Éric Schost, B. Wiebelt. 42-49 [doi]
• The characteristic ideal of a finite, connected, regular graphJosep M. Brunat, Antonio Montes. 50-57 [doi]
• Closed form solutions of linear odes having elliptic function coefficientsReinhold Burger, George Labahn, Mark van Hoeij. 58-64 [doi]
• Inversion of parameterized hypersurfaces by means of subresultantsLaurent Busé, Carlos D Andrea. 65-71 [doi]
• Understanding expression simplificationJacques Carette. 72-79 [doi]
• Non-liouvillian solutions for second order Linear ODEsL. Chan, E. S. Cheb-Terrab. 80-86 [doi]
• Absolute polynomial factorization in two variables and the knapsack problemGuillaume Chèze. 87-94 [doi]
• Support hull: relating the cayley-dixon resultant constructions to the support of a polynomial systemArthur D. Chtcherba, Deepak Kapur. 95-102 [doi]
• Sharp estimates for triangular setsXavier Dahan, Éric Schost. 103-110 [doi]
• Efficient projection orders for CADAndreas Dolzmann, Andreas Seidl, Thomas Sturm. 111-118 [doi]
• FFPACK: finite field linear algebra packageJean-Guillaume Dumas, Pascal Giorgi, Clément Pernet. 119-126 [doi]
• Reliable Krylov-based algorithms for matrix null space and rankWayne Eberly. 127-134 [doi]
• Algorithms for recognizing coordinates in two variables over UFD sHassan El Houari, M hammed El Kahoui. 135-140 [doi]
• Parametrized surfaces in huge P:::3::: of bidegree(1,2)Mohamed Elkadi, André Galligo, Thi Ha Lê. 141-148 [doi]
• Toric ideals of homogeneous phylogenetic modelsNicholas Eriksson. 149-154 [doi]
• Rational general solutions of algebraic ordinary differential equationsRuyong Feng, Xiao-Shan Gao. 155-162 [doi]
• On reducing a system of equations to a single equationGudmund Skovbjerg Frandsen, Igor Shparlinski. 163-166 [doi]
• Approximate factorization of multivariate polynomials via differential equationsShuhong Gao, Erich Kaltofen, John May, Zhengfeng Yang, Lihong Zhi. 167-174 [doi]
• Decomposition of differential polynomials with constant coefficientsXiao-Shan Gao, Mingbo Zhang. 175-182 [doi]
• Differential rational normal forms and a reduction algorithm for hyperexponential funcKeith O. Geddes, Ha Q. Le, Ziming Li. 183-190 [doi]
• Improvements to a triangulation-decomposition algorithm for ordinary differential systems in higher degree casesEvelyne Hubert. 191-198 [doi]
• Computer proofs for polynomial identities in arbitrary many variablesManuel Kauers. 199-204 [doi]
• Sylvester-resultants for bivariate polynomials with planar newton polygonsAmit Khetan, Ning Song, Ron Goldman. 205-212 [doi]
• Hyperexponential solutions of finite-rank ideals in orthogonal ore ringsGeorge Labahn, Ziming Li. 213-220 [doi]
• Symbolic computation in the homogeneous geometric model with clifford algebraHongbo Li. 221-228 [doi]
• Finding the smallest image of a setSteve Linton. 229-234 [doi]
• Computing irredundant irreducible decompositions of large scale monomial idealsR. Alexander Milowski. 235-242 [doi]
• Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstructionMichael B. Monagan. 243-249 [doi]
• The polytope of non-crossing graphs on a planar point setDavid Orden, Francisco Santos. 250-257 [doi]
• From hypercircles to unitsTomás Recio, J. Rafael Sendra, Carlos Villarino. 258-265 [doi]
• Automatic generation of polynomial loopEnric Rodríguez-Carbonell, Deepak Kapur. 266-273 [doi]
• Smith normal form of dense integer matrices fast algorithms into practiceB. David Saunders, Zhendong Wan. 274-281 [doi]
• Symbolic summation with single-nested sum extensionsCarsten Schneider. 282-289 [doi]
• The truncated fourier transform and applicationsJoris van der Hoeven. 290-296 [doi]
• Algorithms for polynomial GCD computation over algebraic function fieldsMark van Hoeij, Michael B. Monagan. 297-304 [doi]
• Extracting mathematical expressions from postscript documentsMichael Yang, Richard J. Fateman. 305-311 [doi]
• On systems of algebraic equations with parametric exponentsKazuhiro Yokoyama. 312-319 [doi]
• The approximate GCD of inexact polynomialsZhonggang Zeng, Barry H. Dayton. 320-327 [doi]