Abstract is missing.
- Algebraic Techniques in Geometry: The 10th AnniversaryMicha Sharir. 1-5 [doi]
- Polynomial Systems Arising From Discretizing Systems of Nonlinear Differential EquationsAndrew J. Sommese. 7-9 [doi]
- Thirty Years of Virtual Substitution: Foundations, Techniques, ApplicationsThomas Sturm. 11-16 [doi]
- Fast Algorithms for Displacement and Low-Rank Structured MatricesShivkumar Chandrasekaran, Nithin Govindarajan, Abhejit Rajagopal. 17-22 [doi]
- GAP 4 at Twenty-one - Algorithms, System Design and ApplicationsStephen A. Linton. 23-24 [doi]
- What Can (and Can't) we Do with Sparse Polynomials?Daniel S. Roche. 25-30 [doi]
- Modular Algorithms for Computing Minimal Associated Primes and Radicals of Polynomial IdealsToru Aoyama, Masayuki Noro. 31-38 [doi]
- Desingularization of First Order Linear Difference Systems with Rational Function CoefficientsMoulay A. Barkatou, Maximilian Jaroschek. 39-46 [doi]
- A New Approach for Formal Reduction of Singular Linear Differential Systems Using EigenringsMoulay A. Barkatou, Joelle Saadé, Jacques-Arthur Weil. 47-54 [doi]
- On the Maximal Number of Real Embeddings of Spatial Minimally Rigid GraphsEvangelos Bartzos, Ioannis Z. Emiris, Jan Legerský, Elias P. Tsigaridas. 55-62 [doi]
- Bilinear Systems with Two Supports: Koszul Resultant Matrices, Eigenvalues, and EigenvectorsMatías R. Bender, Jean-Charles Faugère, Angelos Mantzaflaris, Elias P. Tsigaridas. 63-70 [doi]
- Towards Mixed Gröbner Basis Algorithms: the Multihomogeneous and Sparse CaseMatías R. Bender, Jean-Charles Faugère, Elias P. Tsigaridas. 71-78 [doi]
- A Polynomial-Division-Based Algorithm for Computing Linear Recurrence RelationsJérémy Berthomieu, Jean-Charles Faugère. 79-86 [doi]
- Monodromy Solver: Sequential and ParallelNathan Bliss, Timothy Duff, Anton Leykin, Jeff Sommars. 87-94 [doi]
- Generalized Hermite Reduction, Creative Telescoping and Definite Integration of D-Finite FunctionsAlin Bostan, Frédéric Chyzak, Pierre Lairez, Bruno Salvy. 95-102 [doi]
- A Newton-like Validation Method for Chebyshev Approximate Solutions of Linear Ordinary Differential SystemsFlorent Bréhard. 103-110 [doi]
- Enumeration of Complex Golay Pairs via Programmatic SATCurtis Bright, Ilias S. Kotsireas, Albert Heinle, Vijay Ganesh. 111-118 [doi]
- ZpL: a p-adic Precision PackageXavier Caruso, David Roe, Tristan Vaccon. 119-126 [doi]
- Computing an LLL-reduced Basis of the Orthogonal LaticeJingwei Chen, Damien Stehlé, Gilles Villard. 127-133 [doi]
- Additive Decompositions in Primitive ExtensionsShaoshi Chen, Hao Du, Ziming Li. 135-142 [doi]
- A Symplectic Kovacic's Algorithm in Dimension 4Thierry Combot, Camilo Sanabria. 143-150 [doi]
- Symmetric Indefinite Triangular Factorization Revealing the Rank Profile MatrixJean-Guillaume Dumas, Clément Pernet. 151-158 [doi]
- Computing Nearby Non-trivial Smith FormsMark Giesbrecht, Joseph Haraldson, George Labahn. 159-166 [doi]
- Certification of Minimal Approximant BasesPascal Giorgi, Vincent Neiger. 167-174 [doi]
- Computing Free Distances of Idempotent Convolutional CodesJosé Gómez-Torrecillas, F. J. Lobillo, Gabriel Navarro 0001. 175-182 [doi]
- Effective Computation of Generalized Spectral SequencesAndrea Guidolin, Ana Romero. 183-190 [doi]
- Exact Algorithms for Semidefinite Programs with Degenerate Feasible SetDidier Henrion, Simone Naldi, Mohab Safey El Din. 191-198 [doi]
- Fast Reduction of Bivariate Polynomials with Respect to Sufficiently Regular Gröbner BasesJoris van der Hoeven, Robin Larrieu. 199-206 [doi]
- Constructive Arithmetics in Ore Localizations with Enough CommutativityJohannes Hoffmann, Viktor Levandovskyy. 207-214 [doi]
- Constructive Membership Tests in Some Infinite Matrix GroupsAlexander Hulpke. 215-222 [doi]
- Sparse Polynomial Interpolation With Arbitrary Orthogonal Polynomial BasesErdal Imamoglu, Erich L. Kaltofen, Zhengfeng Yang. 223-230 [doi]
- Algorithmic Arithmetics with DD-Finite FunctionsAntonio Jiménez-Pastor, Veronika Pillwein. 231-237 [doi]
- An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCDDeepak Kapur, Dong Lu, Michael B. Monagan, Yao Sun, DingKang Wang. 239-246 [doi]
- Real Space Sextics and their TritangentsAvinash Kulkarni, Yue Ren, Mahsa Sayyary Namin, Bernd Sturmfels. 247-254 [doi]
- Bivariate Dimension Polynomials of Non-Reflexive Prime Difference-Differential Ideals.: The Case of One TranslationAlexander Levin. 255-262 [doi]
- Frobenius Additive Fast Fourier TransformWen-Ding Li, Ming-Shing Chen, Po-Chun Kuo, Chen-Mou Cheng, Bo-Yin Yang. 263-270 [doi]
- Extending the GVW Algorithm to Local RingDong Lu, DingKang Wang, Fanghui Xiao, Jie Zhou. 271-278 [doi]
- On Exact Polya and Putinar's RepresentationsVictor Magron, Mohab Safey El Din. 279-286 [doi]
- On the Chordality of Polynomial Sets in Triangular Decomposition in Top-Down StyleChenqi Mou, Yang Bai. 287-294 [doi]
- Computing Popov and Hermite Forms of Rectangular Polynomial MatricesVincent Neiger, Johan Rosenkilde, Grigory Solomatov. 295-302 [doi]
- Polynomial Equivalence Problems for Sum of Affine PowersIgnacio García-Marco, Pascal Koiran, Timothée Pecatte. 303-310 [doi]
- Irredundant Triangular DecompositionGleb Pogudin, Ágnes Szántó. 311-318 [doi]
- Volume of Alcoved Polyhedra and Mahler ConjectureMaria J. de la Puente, Pedro L. Claveria. 319-326 [doi]
- The Importance of Being ZeroTomás Recio, J. Rafael Sendra, Carlos Villarino. 327-333 [doi]
- Real Root Finding for Equivariant Semi-algebraic SystemsCordian Riener, Mohab Safey El Din. 335-342 [doi]
- Error Correction in Fast Matrix Multiplication and InverseDaniel S. Roche. 343-350 [doi]
- On the Complexity of Computing Real Radicals of Polynomial SystemsMohab Safey El Din, Zhi-Hong Yang, Lihong Zhi. 351-358 [doi]
- On Continuity of the Roots of a Parametric Zero Dimensional Multivariate Polynomial IdealYosuke Sato, Ryoya Fukasaku, Hiroshi Sekigawa. 359-365 [doi]
- Fast Straightening Algorithm for Bracket Polynomials Based on Tableau ManipulationsChangpeng Shao, Hongbo Li. 367-374 [doi]
- Comparison of CAD-based Methods for Computation of Rational Function LimitsAdam W. Strzebonski. 375-382 [doi]
- On Affine Tropical F5 AlgorithmsTristan Vaccon, Thibaut Verron, Kazuhiro Yokoyama. 383-390 [doi]
- On Computing the Resultant of Generic Bivariate PolynomialsGilles Villard. 391-398 [doi]
- An Approach for Certifying Homotopy Continuation Paths: Univariate CaseJuan Xu, Michael A. Burr, Chee Yap. 399-406 [doi]