default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Symbolic Computation, Volume 99
Volume 99, July 2020
- Laura Menini, Corrado Possieri
, Antonio Tornambè:
A symbolic algorithm to compute immersions of polynomial systems into linear ones up to an output injection. 1-20 - Tommi A. Junttila, Matti Karppa, Petteri Kaski, Jukka Kohonen:
An adaptive prefix-assignment technique for symmetry reduction. 21-49 - Bertrand Nguefack, Emmanuel Pola:
Effective Buchberger-Zacharias-Weispfenning theory of skew polynomial extensions of subbilateral coherent rings. 50-107 - Feng Guo, Tien-Son Pham:
On types of degenerate critical points of real polynomial functions. 108-126 - Eliana Duarte, Christiane Görgen:
Equations defining probability tree models. 127-146 - Teo Mora:
Zacharias representation of effective associative rings. 147-188 - Michael B. Monagan, Baris Tuncer:
The complexity of sparse Hensel lifting and sparse polynomial factorization. 189-230 - Domingo Gómez-Pérez, László Mérai, Igor E. Shparlinski:
On the complexity of exact counting of dynamically irreducible polynomials. 231-241 - Alexander Woo, Alexander Yong:
Tropicalization, symmetric polynomials, and complexity. 242-249 - Janko Böhm, Magdaleen S. Marais, Andreas Steenpaß:
The classification of real singularities using Singular Part III: Unimodal singularities of corank 2. 250-282
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-02-09 14:59 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:
