default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Symbolic Computation, Volume 66
Volume 66, January - February 2015
- Adrian Popescu:
An algorithm to compute the Hilbert depth. 1-7 - Jens-Dietrich Bauch:
Genus computation of global function fields. 8-20 - Manuel Kauers, Lily Yen:
On the length of integers in telescopers for proper hypergeometric terms. 21-33 - Kurt Mehlhorn, Michael Sagraloff, Pengming Wang:
From approximate factorization to root isolation with application to cylindrical algebraic decomposition. 34-69 - Susan Margulies, Shmuel Onn
, Dmitrii V. Pasechnik:
On the complexity of Hilbert refutations for partition. 70-83 - Lei Feng, Weiping Wang:
An algorithm for computing mixed sums of products of Bernoulli polynomials and Euler polynomials. 84-97 - Alexey A. Kytmanov, A. M. Kytmanov, Evgeniya K. Myshkina:
Finding residue integrals for systems of non-algebraic equations in Cn. 98-110 - Guillaume Hanrot, Paul Zimmermann:
Corrigendum to "A long note on Mulders' short product" [J. Symb. Comput 37 (3) (2004) 391-401]. 111-112
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 2024-11-08 20:37 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:
