default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Communications in Computer Algebra, Volume 43
Volume 43, Numbers 1/2, March / June 2009
- Kevin A. Broughan:
An algorithm for the explicit evaluation of GL(n;R) Kloosterman sums. 1-10 - Emmanuel Thomé:
Abstracts of the CADO workshop on integer factorization. 11-14 - Anthony C. Hearn:
REDUCE is free software as of January 2009. 15-16 - Conference announcements. 17-20
- Michael Abramson:
Historical background to Gröbner's paper. 22-23 - Wolfgang Gröbner:
On the algebraic properties of integrals of linear differential equations with constant coefficients. 24-46 - David Joyner:
AMS special session on SAGE and mathematical research using open source software. 49-54
Volume 43, Numbers 3/4, September / December 2009
- Jürgen Gerhard, D. J. Jeffrey, Guillaume Moroz:
A package for solving parametric polynomial systems. 61-72 - David R. Stoutemyer:
Unit normalization of multinomials over Gaussian integers. 73-76
- Cristina Bertone, Guillaume Chèze, André Galligo:
Probabilistic algorithms for polynomial absolute factorization. 77-78 - Howard Cheng, George Labahn:
Applying linear algebra routines to modular ore polynomial matrix algorithms. 78-79 - Annie A. M. Cuyt, Wen-shin Lee:
Symbolic-numeric sparse interpolation of multivariate rational functions. 79-80 - Javier Esparza, Andreas Gaiser, Stefan Kiefer:
On least fixed points of systems of positive polynomials. 81-83 - Shutaro Inoue, Yosuke Sato:
Implementation of Boolean Gröbner bases in Risa/Asir. 83-84 - Claude-Pierre Jeannerod, Christophe Mouilleron, Gilles Villard:
Extending Cardinal's algorithm to a broader class of structured matrices. 84-85 - Marc Moreno Maza, Yuzhen Xie:
Balanced dense polynomial multiplication on multi-cores. 85-87 - Hiroshi Murakami:
A continued fraction type method to find a rational number in a given closed interval whose denominator is minimal. 88-90 - Hiroki Nakayama, Hiroshi Sekigawa:
Determining divisibility between polynomials with inexact coefficients. 91-94 - Moshe Porat:
A vector-quantization approach to coding systems. 94-96 - Bjarke Hammersholt Roune:
A slice algorithm for koszul simplicial complexes on the lcm lattice of monomial ideals. 96-98 - Eduardo Sáenz-de-Cabezón, Henry P. Wynn
:
Efficient algorithms for the algebraic analysis of system reliability. 98-99 - Tateaki Sasaki, Yasutaka Ookura:
Approximate factorization of polynomials in Z[x]. 99-101 - Nikta Shayanfar, Mahmoud Hadizadeh:
Computer algebraic efficiency of matrix polynomials for a system of integral equations. 101-102 - Kiyoshi Shirayanagi, Hiroshi Sekigawa:
A new method of reducing exact computations to obtain exact results. 102-104 - Akira Suzuki:
Computing gröbner bases within linear algebra and its implementation. 104-105 - David Joyner:
Open source computer algebra systems: GAP. 110-118 - Christoph Koutschan:
Advanced applications of the holonomic systems approach. 119 - David Richardson:
Effcient programming techniques for the SACLIB computer algebra library. 120 - Xin Li:
Toward high-performance polynomial system solvers based on triangular decompositions. 120 - Hui Ding:
Numerical and symbolic computation of the Lambert W function in Cnxn. 121
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-15 00:22 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:
