Abstract is missing.
- Mathematics by machineNoriko H. Arai, Takuya Matsuzaki, Hidenao Iwane, Hirokazu Anai. 1-8 [doi]
- Fuzzy simplification of non-numeric expressions containing some intervals and/or floating point numbersDavid R. Stoutemyer. 9-16 [doi]
- Maximum likelihood for matrices with rank constraintsBernd Sturmfels. 17 [doi]
- Effective quantifier elimination for industrial applicationsHirokazu Anai. 18-19 [doi]
- How to develop a mobile computer algebra systemMitsushi Fujimoto. 20 [doi]
- Introduction to max-plus algebraHiroyuki Goto. 21-22 [doi]
- Algebraic complexity theory and matrix multiplicationFrançois Le Gall. 23 [doi]
- Gröbner bases of toric ideals and their applicationHidefumi Ohsugi. 24 [doi]
- Symbolic-numeric algorithms for computing validated resultsLihong Zhi. 25-26 [doi]
- Sparse interpolation over finite fields via low-order roots of unityAndrew Arnold, Mark Giesbrecht, Daniel S. Roche. 27-34 [doi]
- Multivariate sparse interpolation using randomized Kronecker substitutionsAndrew Arnold, Daniel S. Roche. 35-42 [doi]
- Computing the differential Galois group of a parameterized second-order linear differential equationCarlos E. Arreche. 43-50 [doi]
- A new deterministic algorithm for sparse multivariate polynomial interpolationMarkus Bläser, Gorav Jindal. 51-58 [doi]
- A fast algorithm for computing the characteristic polynomial of the p-curvatureAlin Bostan, Xavier Caruso, Éric Schost. 59-66 [doi]
- Computing necessary integrability conditions for planar parametrized homogeneous potentialsAlin Bostan, Thierry Combot, Mohab Safey El Din. 67-74 [doi]
- Improved algorithm for computing separating linear forms for bivariate systemsYacine Bouzidi, Sylvain Lazard, Guillaume Moroz, Marc Pouget, Fabrice Rouillier. 75-82 [doi]
- Solving higher order linear differential equations having elliptic function coefficientsReinhold Burger. 83-90 [doi]
- Quantifier elimination by cylindrical algebraic decomposition based on regular chainsChangbo Chen, Marc Moreno Maza. 91-98 [doi]
- Parallel telescoping and parameterized Picard-Vessiot theoryShaoshi Chen, Ruyong Feng, Ziming Li, Michael F. Singer. 99-106 [doi]
- A generalized Apagodu-Zeilberger algorithmShaoshi Chen, Manuel Kauers, Christoph Koutschan. 107-114 [doi]
- The asymptotic analysis of some interpolated nonlinear recurrence relationsRobert M. Corless, David J. Jeffrey, Fei Wang. 115-121 [doi]
- Fast arithmetic for the algebraic closure of finite fieldsLuca De Feo, Javad Doliskani, Éric Schost. 122-129 [doi]
- On the computation of the topology of plane curvesDaouda Niang Diatta, Fabrice Rouillier, Marie-Françoise Roy. 130-137 [doi]
- Logspace computations in graph productsVolker Diekert, Jonathan Kausch. 138-145 [doi]
- Essentially optimal interactive certificates in linear algebraJean-Guillaume Dumas, Erich Kaltofen. 146-153 [doi]
- Root counts of semi-mixed systems, and an application to counting nash equilibriaIoannis Z. Emiris, Raimundas Vidunas. 154-161 [doi]
- Synthesis of optimal numerical algorithms using real quantifier elimination (case study: square root computation)Madalina Erascu, Hoon Hong. 162-169 [doi]
- Sub-cubic change of ordering for Gröbner basis: a probabilistic approachJean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault. 170-177 [doi]
- Sparse Gröbner bases: the unmixed caseJean-Charles Faugère, Pierre-Jean Spaenlehauer, Jules Svartz. 178-185 [doi]
- MMO problemOscar García Morchón, Domingo Gómez-Pérez, Jaime Gutierrez, Ronald Rietman, Ludo Tolhuizen. 186-193 [doi]
- n variablesMark Giesbrecht, Albert Heinle, Viktor Levandovskyy. 194-201 [doi]
- Online order basis algorithm and its impact on the block Wiedemann algorithmPascal Giorgi, Romain Lebreton. 202-209 [doi]
- On isomorphisms of modules over non-commutative PIDJosé Gómez-Torrecillas, F. J. Lobillo, Gabriel Navarro. 210-216 [doi]
- Radical solutions of first order autonomous algebraic ordinary differential equationsGeorg Grasegger. 217-223 [doi]
- Computing low-degree factors of lacunary polynomials: a Newton-Puiseux approachBruno Grenet. 224-231 [doi]
- Maximum likelihood geometry in the presence of data zerosElizabeth Gross, Jose Israel Rodriguez. 232-239 [doi]
- Constructing fewer open cells by GCD computation in CAD projectionJingjun Han, Liyun Dai, Bican Xia. 240-247 [doi]
- a posteriori certification algorithm for Newton homotopiesJonathan D. Hauenstein, Ian Haywood, Alan C. Liddell Jr.. 248-255 [doi]
- Evaluating parametric holonomic sequences using rectangular splittingFredrik Johansson. 256-263 [doi]
- Equivariant lattice generators and Markov basesThomas Kahle, Robert Krone, Anton Leykin. 264-271 [doi]
- Sparse polynomial interpolation codes and their decoding beyond half the minimum distanceErich L. Kaltofen, Clément Pernet. 272-279 [doi]
- Sparse multivariate function recovery with a high error rate in the evaluationsErich L. Kaltofen, Zhengfeng Yang. 280-287 [doi]
- Bounds for D-finite closure propertiesManuel Kauers. 288-295 [doi]
- Powers of tensors and fast matrix multiplicationFrançois Le Gall. 296-303 [doi]
- Reduction among bracket polynomialsHongbo Li, Changpeng Shao, Lei Huang, Yue Liu. 304-311 [doi]
- Formal solutions of a class of Pfaffian systems in two variablesSuzy S. Maddah, Moulay A. Barkatou, Hassan Abbas. 312-319 [doi]
- On the reduction of singularly-perturbed linear differential systemsSuzy S. Maddah, Moulay A. Barkatou, Hassan Abbas. 320-327 [doi]
- High performance implementation of the TFTLingchuan Meng, Jeremy R. Johnson. 328-334 [doi]
- Randomized detection of extraneous factorsManfred Minimair. 335-342 [doi]
- Toric border basisBernard Mourrain, Philippe Trébuchet. 343-350 [doi]
- On efficient algorithms for computing parametric local cohomology classes associated with semi-quasihomogeneous singularities and standard basesKatsusuke Nabeshima, Shinichi Tajima. 351-358 [doi]
- A near-optimal algorithm for computing real roots of sparse polynomialsMichael Sagraloff. 359-366 [doi]
- LLL reducing with the most significant bitsSaruchi, Ivan Morel, Damien Stehlé, Gilles Villard. 367-374 [doi]
- Covering of surfaces parametrized without projective base pointsJ. Rafael Sendra, David Sevilla, Carlos Villarino. 375-380 [doi]
- Linear independence oracles and applications to rectangular and low rank linear systemsArne Storjohann, Shiyun Yang. 381-388 [doi]
- Cylindrical algebraic decomposition using local projectionsAdam W. Strzebonski. 389-396 [doi]
- Matrix-F5 algorithms over finite-precision complete discrete valuation fieldsTristan Vaccon. 397-404 [doi]
- Faster relaxed multiplicationJoris van der Hoeven. 405-412 [doi]
- Unimodular completion of polynomial matricesWei Zhou, George Labahn. 413-420 [doi]
- Tame decompositions and collisionsKonstantin Ziegler. 421-428 [doi]