default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Symbolic Computation, Volume 102
Volume 102, January 2021
- Manuel Kauers, Alexey Ovchinnikov, Éric Schost:
Foreword. 1-2 - Deepak Kapur, Dong Lu, Michael B. Monagan, Yao Sun, Dingkang Wang:
Algorithms for computing greatest common divisors of parametric multivariate polynomials. 3-20 - Christian Eder, Gerhard Pfister, Adrian Popescu:
Standard bases over Euclidean domains. 21-36 - José Gómez-Torrecillas, Francisco Javier Lobillo, Gabriel Navarro:
Cyclic distances of idempotent convolutional codes. 37-62 - Bernard Mourrain, Simon Telen
, Marc Van Barel:
Truncated normal forms for solving polynomial systems: Generalized and efficient algorithms. 63-85 - Moulay A. Barkatou, Maximilian Jaroschek:
Removing apparent singularities of linear difference systems. 86-107 - Chenqi Mou, Yang Bai, Jiahua Lai:
Chordal graphs in triangular decomposition in top-down style. 108-131 - Tristan Vaccon, Thibaut Verron, Kazuhiro Yokoyama:
On affine tropical F5 algorithms. 132-152 - Curtis Bright, Ilias S. Kotsireas, Albert Heinle, Vijay Ganesh:
Complex Golay pairs up to length 28: A search via computer algebra and programmatic SAT. 153-172 - Alexander Levin:
Bivariate Kolchin-type dimension polynomials of non-reflexive prime difference-differential ideals. The case of one translation. 173-188 - Evangelos Bartzos, Ioannis Z. Emiris, Jan Legerský, Elias P. Tsigaridas:
On the maximal number of real embeddings of minimally rigid graphs in R2, R3 and S2. 189-208 - Johannes Hoffmann, Viktor Levandovskyy:
Constructive arithmetics in Ore localizations enjoying enough commutativity. 209-230 - Moulay A. Barkatou, Joelle Saadé, Jacques-Arthur Weil:
Formal reduction of singular linear differential systems using eigenrings: A refined approach. 231-258 - Mohab Safey El Din, Zhi-Hong Yang, Lihong Zhi:
Computing real radicals and S-radicals of polynomial systems. 259-278 - Johan Rosenkilde, Arne Storjohann:
Algorithms for simultaneous Hermite-Padé approximations. 279-303 - Mark Giesbrecht, Joseph Haraldson, George Labahn:
Computing nearby non-trivial Smith forms. 304-327
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 2025-12-04 01:29 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
