default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Communications in Computer Algebra, Volume 54
Volume 54, Number 1, March 2020
- Joris van der Hoeven
, Grégoire Lecerf:
Ultimate complexity for numerical algorithms. 1-13 - Werner M. Seiler:
Jacques Calmet dies at 77. 14-15
Volume 54, Number 2, June 2020
- Sergei A. Abramov, Denis E. Khmelnov, Anna A. Ryabenko:
Checkpoints in searching for rational solutions of linear ordinary difference and differential systems. 18-29 - Antonio Jiménez-Pastor, Alin Bostan, Frédéric Chyzak, Pierre Lairez:
The Sage package comb_walks for walks in the quarter plane. 30-38 - Colin Crowley, Jose Israel Rodriguez, Jacob Weiker, Jacob Zoromski:
MultiRegeneration for polynomial system solving. 39-43 - Marc Härkönen, Benjamin Hollering, Fatemeh Tarashi Kashani, Jose Israel Rodriguez:
Algebraic optimization degree. 44-48 - Christina Katsamaki, Fabrice Rouillier, Elias P. Tsigaridas, Zafeirakis Zafeirakopoulos:
PTOPO: a maple package for the topology of parametric curves. 49-52 - Przemyslaw Koprowski:
CQF Magma package. 53-56 - Ana Romero, Julio Rubio, Francis Sergeraert, Markus Szymik:
A new Kenzo module for computing the Eilenberg-Moore spectral sequence. 57-60 - Michael B. Monagan:
The 2019 Richard D. Jenks memorial prize. 61 - Recent and upcoming events. 62-64
Volume 54, Number 3, September 2020
- Joris van der Hoeven, Michael B. Monagan:
Computing one billion roots using the tangent Graeffe method. 65-85 - J. Maurice Rojas, Yuyu Zhu:
A complexity chasm for solving sparse polynomial equations over p-adic fields: extended abstract. 86-90 - Jiayue Qi:
A calculus for monomials in Chow group of zero cycles in the moduli space of stable curves. 91-94 - Sebastian Lindner, Laurent Imbert, Michael J. Jacobson Jr.:
Improved divisor arithmetic on generic hyperelliptic curves. 95-99 - Julia Lindberg, Nigel Boston, Bernard C. Lesieutre:
Exploiting symmetry in the power flow equations using monodromy. 100-104 - Katherine Harris, Jonathan D. Hauenstein, Ágnes Szántó:
Smooth points on semi-algebraic sets. 105-108 - Jérémy Berthomieu, Andrew Ferguson, Mohab Safey El Din:
Towards fast one-block quantifier elimination through generalised critical values. 109-113 - Apostolos Chalkis, Vissarion Fisikopoulos, Panagiotis Repouskos, Elias P. Tsigaridas:
Sampling the feasible sets of SDPs and volume approximation. 114-118 - Andrey Bychkov, Gleb Pogudin:
Optimal monomial quadratization for ODE systems: extended abstract. 119-123
Volume 54, Number 4, December 2020
- Erdal Imamoglu, Erich L. Kaltofen:
A note on sparse polynomial interpolation in Dickson polynomial basis. 125-128 - Maheswara Rao Valluri:
Combinatorial primality test. 129-133 - Miao-Jung Yvonne Ou:
Teaching multivariable calculus and tensor calculus with computer algebra software. 134-135
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-08-09 23:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
