| | International Conference on Symbolic and Algebraic Computation archiveProceedings of the 2002 international symposium on Symbolic and algebraic computation citation2002, Lille, France July 07 - 10, 2002 | | | Table of Contents | | | | Applicability of Zeilberger's algorithm to hypergeometric terms
S. A. Abramov
Pages: 1 - 7
Full text available:  Pdf(168 KB) | | | | Fraction-free row reduction of matrices of skew polynomials
Bernhard Beckermann, Howard Cheng, George Labahn
Pages: 8 - 15
Full text available: Pdf(253 KB) | | | | Towards better simplification of elementary functions
Russell Bradford, James H. Davenport
Pages: 16 - 22
Full text available: Pdf(188 KB) | | | | Solutions of linear ordinary differential equations in terms of special functions
Manuel Bronstein, Sébastien Lafaille
Pages: 23 - 28
Full text available: Pdf(181 KB) | | | | On the efficiency and optimality of Dixon-based resultant methods
Arthur D. Chtcherba, Deepak Kapur
Pages: 29 - 36
Full text available: Pdf(234 KB) | | | | A geometric-numeric algorithm for absolute factorization of multivariate polynomials
Robert M. Corless, André Galligo, Ilias S. Kotsireas, Stephen M. Watt
Pages: 37 - 45
Full text available: Pdf(210 KB) | | | | Multihomogeneous resultant matrices
Alicia Dickenstein, Ioannis Z. Emiris
Pages: 46 - 54
Full text available: Pdf(345 KB) | | | | Editing mathematical content and presentation markup in interactive mathematical documents
Samuel S. Dooley
Pages: 55 - 62
Full text available: Pdf(185 KB) | | | | Finite field linear algebra subroutines
Jean Guillaume Dumas, Thierry Gautier, Clément Pernet
Pages: 63 - 74
Full text available: Pdf(416 KB) | | | | A new efficient algorithm for computing Gröbner bases without reduction to zero (F5)
Jean Charles Faugère
Pages: 75 - 83
Full text available: Pdf(277 KB) | | | | Partial solvability by radicals
P. Fernandez-Ferreiros, M. A. Gomez-Molleda, L. Gonzalez-Vega
Pages: 84 - 91
Full text available: Pdf(209 KB) | | | | Computing the topology of real algebraic surfaces
Elisabetta Fortuna, Patrizia Gianni, Paola Parenti, Carlo Traverso
Pages: 92 - 100
Full text available: Pdf(240 KB) | | | | Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm
Mark Giesbrecht, Erich Kaltofen, Wen-shin Lee
Pages: 101 - 108
Full text available: Pdf(260 KB) | | | | A modular GCD algorithm over number fields presented with multiple extensions
Mark van Hoeij, Michael Monagan
Pages: 109 - 116
Full text available: Pdf(221 KB) | | | | A new zero-test for formal power series
Joris van der Hoeven
Pages: 117 - 122
Full text available: Pdf(199 KB) | | | | Sparsity issues in the computation of Jacobian matrices
Shahadat Hossain, Trond Steihaug
Pages: 123 - 130
Full text available: Pdf(188 KB) | | | | A reduced form for perturbed matrix polynomials
Claude Pierre Jeannerod
Pages: 131 - 137
Full text available: Pdf(224 KB) | | | | An output-sensitive variant of the baby steps/giant steps determinant algorithm
Erich Kaltofen
Pages: 138 - 144
Full text available: Pdf(226 KB) | | | | Determinantal formula for the chow form of a toric surface
Amit Khetan
Pages: 145 - 150
Full text available: Pdf(189 KB) | | | | Computation of canonical forms for ternary cubics
Irina A. Kogan, Marc Moreno Maza
Pages: 151 - 160
Full text available: Pdf(253 KB) | | | | Simplification of definite sums of rational functions by creative symmetrizing method
Ha Le
Pages: 161 - 167
Full text available: Pdf(170 KB) | | | | Factoring zero-dimensional ideals of linear partial differential operators
Ziming Li, Fritz Schwarz, Serguei P. Tsarev
Pages: 168 - 175
Full text available: Pdf(221 KB) | | | | Polynomial-time normalizers for permutation groups with restricted composition factors
Eugene M. Luks, Takunari Miyazaki
Pages: 176 - 183
Full text available: Pdf(221 KB) | | | | The differential Hilbert function of a differential rational mapping can be computed in polynomial time
Guillermo Matera, Alexandre Sedoglavic
Pages: 184 - 191
Full text available: Pdf(244 KB) | | | | Towards certified irreducibility testing of bivariate approximate polynomials
Kosaku Nagasaka
Pages: 192 - 199
Full text available: Pdf(212 KB) | | | | Yet another practical implementation of polynomial factorization over finite fields
Masayuki Noro, Kazuhiro Yokoyama
Pages: 200 - 206
Full text available: Pdf(197 KB) | | | | Acceleration of Euclidean algorithm and extensions
Victor Y. Pan, Xinmao Wang
Pages: 207 - 213
Full text available: Pdf(192 KB) | | | | Some observations on familiar numbers
Daniel Richardson, Simon Langley
Pages: 214 - 220
Full text available: Pdf(195 KB) | | | | Towards faster real algebraic numbers
Renaud Rioboo
Pages: 221 - 228
Full text available: Pdf(221 KB) | | | | Simplification of surface parametrizations
Josef Schicho
Pages: 229 - 237
Full text available: Pdf(188 KB) | | | | Degree bounds and lifting techniques for triangular sets
Éric Schost
Pages: 238 - 245
Full text available: Pdf(223 KB) | | | | High-order lifting
Arne Storjohann
Pages: 246 - 254
Full text available: Pdf(221 KB) | | | | An alternative approach to comprehensive Gröbner bases
Akira Suzuki, Yosuke Sato
Pages: 255 - 261
Full text available: Pdf(180 KB) | | | | Numerical stability and stabilization of Groebner basis computation
Carlo Traverso, Alberto Zanoni
Pages: 262 - 269
Full text available: Pdf(165 KB) | | | | Canonical comprehensive Gröbner bases
Volker Weispfenning
Pages: 270 - 276
Full text available: Pdf(169 KB) | |
|
QuickTime
Windows Media Player
Real Player
