Abstract is missing.
- Algebraic invariants and their differential algebrasEvelyne Hubert. 1-2 [doi]
- Verification methods: rigorous results using floating-point arithmeticSiegfried M. Rump. 3-4 [doi]
- Theory of reals for verification and synthesis of hybrid dynamical systemsAshish Tiwari. 5-6 [doi]
- Symbolic methods for solving systems of linear ordinary differential equationsMoulay A. Barkatou. 7-8 [doi]
- Asymptotically fast algorithms for modern computer algebraJürgen Gerhard. 9-10 [doi]
- Transformation and factorization of partial differential systems: applications to stochastic systemsSergey P. Tsarev. 11-12 [doi]
- A new incremental algorithm for computing Groebner basesShuhong Gao, Yinhua Guan, Frank Volny. 13-19 [doi]
- Degree bounds for Gröbner bases of low-dimensional polynomial idealsErnst W. Mayr, Stephan Ritscher. 21-27 [doi]
- A new algorithm for computing comprehensive Gröbner systemsDeepak Kapur, Yao Sun, DingKang Wang. 29-36 [doi]
- Finding all bessel type solutions for linear differential equations with rational function coefficientsMark van Hoeij, Quan Yuan. 37-44 [doi]
- Simultaneously row- and column-reduced higher-order linear differential systemsMoulay A. Barkatou, Carole El Bacha, Eckhard Pflügel. 45-52 [doi]
- Consistency of finite difference approximations for linear PDE systems and its algorithmic verificationVladimir P. Gerdt, Daniel Robertz. 53-59 [doi]
- Computation with semialgebraic sets represented by cylindrical algebraic formulasAdam W. Strzebonski. 61-68 [doi]
- Black-box/white-box simplification and applications to quantifier eliminationChristopher W. Brown, Adam W. Strzebonski. 69-76 [doi]
- Parametric quantified SAT solvingThomas Sturm, Christoph Zengler. 77-84 [doi]
- A method for semi-rectifying algebraic and differential systems using scaling type lie point symmetries with linear algebraFrançois Lemaire, Asli Ürgüplü. 85-92 [doi]
- Absolute factoring of non-holonomic ideals in the planeDima Grigoriev, Fritz Schwarz. 93-97 [doi]
- Algorithms for Bernstein-Sato polynomials and multiplier idealsChristine Berkesch, Anton Leykin. 99-106 [doi]
- Global optimization of polynomials using generalized critical values and sums of squaresFeng Guo, Mohab Safey El Din, Lihong Zhi. 107-114 [doi]
- A Slice algorithm for corners and Hilbert-Poincaré series of monomial idealsBjarke Hammersholt Roune. 115-122 [doi]
- Composition collisions and projective polynomials: statement of resultsJoachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler. 123-130 [doi]
- Decomposition of generic multivariate polynomialsJean-Charles Faugère, Joachim von zur Gathen, Ludovic Perret. 131-137 [doi]
- NumGfun: a package for numerical and analytic computation with D-finite functionsMarc Mezzarobba. 139-145 [doi]
- Chebyshev interpolation polynomial-based tools for rigorous computingNicolas Brisebarre, Mioara Joldes. 147-154 [doi]
- Blind image deconvolution via fast approximate GCDZijia Li, Zhengfeng Yang, Lihong Zhi. 155-162 [doi]
- Polynomial integration on regions defined by a triangle and a conicDavid Sevilla, Daniel Wachsmuth. 163-170 [doi]
- Computing the singularities of rational space curvesXiaoran Shi, Falai Chen. 171-178 [doi]
- Solving schubert problems with Littlewood-Richardson homotopiesFrank Sottile, Ravi Vakil, Jan Verschelde. 179-186 [doi]
- Triangular decomposition of semi-algebraic systemsChangbo Chen, James H. Davenport, John P. May, Marc Moreno Maza, Bican Xia, Rong Xiao. 187-194 [doi]
- When can we detect that a P-finite sequence is positive?Manuel Kauers, Veronika Pillwein. 195-201 [doi]
- Complexity of creative telescoping for bivariate rational functionsAlin Bostan, Shaoshi Chen, Frédéric Chyzak, Ziming Li. 203-210 [doi]
- Partial denominator bounds for partial linear difference equationsManuel Kauers, Carsten Schneider. 211-218 [doi]
- Real and complex polynomial root-finding with eigen-solving and preprocessingVictor Y. Pan, Ailong Zheng. 219-226 [doi]
- Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg s methodSharon Hutton, Erich Kaltofen, Lihong Zhi. 227-234 [doi]
- Random polynomials and expected complexity of bisection methods for real solvingIoannis Z. Emiris, André Galligo, Elias P. Tsigaridas. 235-242 [doi]
- The DMM bound: multivariate (aggregate) separation boundsIoannis Z. Emiris, Bernard Mourrain, Elias P. Tsigaridas. 243-250 [doi]
- Solving Bezout-like polynomial equations for the design of interpolatory subdivision schemesCostanza Conti, Luca Gemignani, Lucia Romani. 251-256 [doi]
- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptologyJean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer. 257-264 [doi]
- Output-sensitive decoding for redundant residue systemsMajid Khonji, Clément Pernet, Jean-Louis Roch, Thomas Roche, Thomas Stalinski. 265-272 [doi]
- A Strassen-like matrix multiplication suited for squaring and higher power computationMarco Bodrato. 273-280 [doi]
- Computing specified generators of structured matrix inversesClaude-Pierre Jeannerod, Christophe Mouilleron. 281-288 [doi]
- Yet another block Lanczos algorithm: how to simplify the computation and reduce reliance on preconditioners in the small field caseWayne Eberly. 289-296 [doi]
- Liouvillian solutions of irreducible second order linear difference equationsMark van Hoeij, Giles Levy. 297-301 [doi]
- Solving recurrence relations using local invariantsYongjae Cha, Mark van Hoeij, Giles Levy. 303-309 [doi]
- On some decidable and undecidable problems related to q-difference equations with parametersS. A. Abramov. 311-317 [doi]
- Iterative Toom-Cook methods for very unbalanced long integer multiplicationAlberto Zanoni. 319-323 [doi]
- An in-place truncated fourier transform and applications to polynomial multiplicationDavid Harvey, Daniel S. Roche. 325-329 [doi]
- Randomized NP-completeness for ::::p::::-adic rational roots of sparse polynomials in one variableMartin Avendano, Ashraf Ibrahim, J. Maurice Rojas, Korben Rusek. 331-338 [doi]
- Easy composition of symbolic computation software: a new lingua franca for symbolic computationSteve Linton, Kevin Hammond, Alexander Konovalov, Abdallah Al Zain, Philip W. Trinder, Peter Horn, Dan Roozemond. 339-346 [doi]
- Symbolic integration at compile time in finite element methodsKarl Rupp. 347-354 [doi]
- Fast multiplication of large permutations for disk, flash memory and RAMVlad Slavici, Xin Dong 0004, Daniel Kunkle, Gene Cooperman. 355-362 [doi]