| |
International
Conference on Symbolic and Algebraic Computation >archive
Proceedings
of the 2001 international symposium on Symbolic and algebraic computation
2001 |
|
| |
Table of
Contents |
|
| |
|
|
| |
|
|
| |
On
solutions of linear functional systems
Sergei A. Abramov,
Manuel Bronstein
Pages: 1 - 6 > full text |
|
| |
| |
Minimal
decomposition of indefinite hypergeometric sums
Sergei A.
Abramov, M. Petkovsek
Pages: 7 - 14 > full text |
|
| |
| |
On
the Barnes function
V. S. Adamchik
Pages: 15 -
20 > full text |
|
| |
| |
Generic
ideals and Moreno-Socías conjucture
Edith Aguirre, Abdul
Salam Jarrah, Reinhard Laubenbacher
Pages: 21 - 23 > full text |
|
| |
| |
Hybrid
sparse resultant matrices for bivariate systems
Carlos
D'Andrea, Ioannis Z. Emiris
Pages: 24 - 31 > full text |
|
| |
| |
Maple's
evaluation process as constraint contextual rewriting
Alessandro Armando, Clemens Ballarin
Pages: 32
- 37 > full text |
|
| |
| |
PARDI!
François Boulier, François Lemaire, Marc Moreno Maza
Pages: 38 - 47 > full text |
|
| |
| |
Residual
resultant over the projective plane and the implicitization problem
Laurent Busé
Pages: 48 - 55 > full text |
|
| |
| |
Families
of estimable terms
Massimo Caboara, Lorenzo Robbiano
Pages: 56 - 63 > full text |
|
| |
| |
Computing
all factorizations in ***
Howard Cheng, George Labahn
Pages: 64 - 71 > full text |
|
| |
| |
Computation
of minimal generators of ideals of fat points
Francesca
Cioffi, Ferruccio Orecchia
Pages: 72 - 76 > full text |
|
| |
| |
Scalable
parallel coset enumeration using bulk definition
Gene
Cooperman, Victor Grinberg
Pages: 77 - 84 > full text |
|
| |
| |
Towards
factoring bivariate approximate polynomials
Robert M.
Corless, Mark W. Giesbrecht, Mark van Hoeij, Ilias S. Kotsireas, Stephen
M. Watt
Pages: 85 - 92 > full text |
|
| |
| |
On
Liouvillian solutions of linear differential equations of order 4 and 5
Olivier Cormier
Pages: 93 - 100 > full text |
|
| |
| |
Hybrid
computation
Jean Della Dora, Aude Maignan, Mihaela
Mirica-Ruse, Sergio Yovine
Pages: 101 - 108 > full text |
|
| |
| |
Modeling
inheritance as coercion in a symbolic computation system
César Domínguez, Julio Rubio
Pages: 109 -
115 > full text |
|
| |
| |
Computation
of the radical of polynomial ideals over fields of arbitrary
characteristic
Elisabetta Fortuna, Patrizia Gianni, Barry
Trager
Pages: 116 - 120 > full text |
|
| |
| |
Polynomial
root finding using iterated Eigenvalue computation
Steven
Fortune
Pages: 121 - 128 > full text |
|
| |
| |
On
computer-assisted classification of coupled integrable equations
Mikhail V. Foursov, Marc Moreno Maza
Pages:
129 - 136 > full text |
|
| |
| |
Semi-numerical
determination of irreducible branches of a reduced space curve
André Galligo, David Rupprecht
Pages: 137 -
142 > full text |
|
| |
| |
A
generalized Graeffe's iteration for evaluating polynomials and rational
functions
Luca Gemignani
Pages: 143 -
149 > full text |
|
| |
| |
Symbolic-interval
cooperation in constraint programming
Laurent
Granvilliers, Eric Monfroy, Frédéric Benhamou
Pages: 150 -
166 > full text |
|
| |
| |
Unirational
fields of transcendence degree one and functional decomposition
Jamie Gutierrez, Rosario Rubio, David Sevilla
Pages: 167 - 174 > full text |
|
| |
| |
Solvability
by radicals from an algorithmic point of view
G. Hanrot,
F. Morain
Pages: 175 - 182 > full text |
|
| |
| |
Strongly-local
reductions and the complexity/efficient approximability of algebra and
optimization on abstract algebraic structures
Harry B.
Hunt, Madhav V. Marathe, Richard E. Stearns
Pages: 183 -
191 > full text |
|
| |
| |
The
membership problem for ideals of binomial skew polynomial rings
Liu Jinwang, Liu Zhuojun, Liu Xiaoqi, Wang Mingsheng
Pages: 192 - 195 > full text |
|
| |
| |
Diagnosing
and correcting student's misconceptions in an educational computer algebra
system
Neven Jurkovic
Pages: 195 - 200
> full text |
|
| |
| |
Dimensional
analysis in computer algebra
Raya Khanin
Pages: 201 - 208 > full text |
|
| |
| |
Hybrid
system for multi-language and multi-environment generation of numerical
codes
Joze Korelc
Pages: 209 - 216 > full text |
|
| |
| |
Towards
approximations which preserve integrals
Elizabeth L.
Mansfield, Peter E. Hydon
Pages: 217 - 222 > full text |
|
| |
| |
On
propagation of equational constraints in CAD-based quantifier elimination
Scott McCallum
Pages: 223 - 231 > full text |
|
| |
| |
A
linear space algorithm for computing the hermite normal form
Daniele Micciancio, Bogdan Warinschi
Pages:
231 - 236 > full text |
|
| |
| |
Remarks
on Gröbner basis for ideals under composition
Wang
Mingsheng, Liu Zhuojun
Pages: 237 - 244 > full text |
|
| |
| |
Algorithms
for trigonometric polynomials
Jamie Mulholland, Michael
Monagan
Pages: 245 - 252 > full text |
|
| |
| |
Univariate
polynomials: nearly optimal algorithms for factorization and rootfinding
Victor Y. Pan
Pages: 253 - 267 > full text |
|
| |
| |
New
complexity bounds for cylindrical decompositions of sub-pfaffian sets
Savvas Pericleous, Nicolai Vorobjov
Pages: 268
- 275 > full text |
|
| |
| |
A
multivariate Weierstrass iterative rootfinder
Olivier
Ruatta
Pages: 276 - 283 > full text |
|
| |
| |
Approximate
multivariate polynomial factorization based on zero-sum relations
Tateaki Sasaki
Pages: 284 - 291 > full text |
|
| |
| |
Discrete
comprehensive Gröbner bases
Yosuke Sato, Akira Suzuki
Pages: 292 - 296 > full text |
|
| |
| |
Black
box methods for least squares problems
B. D. Saunders
Pages: 297 - 302 > full text |
|
| |
| |
On
a parallel Lehmer-Euclid GCD algorithm
Sidi Mohammed
Sedjelmaci
Pages: 303 - 308 > full text |
|
| |
| |
A
probabilistic algorithm to test local algebraic observability in
polynomial time
Alexandre Sedoglavic
Pages:
309 - 317 > full text |
|
| |
| |
Computation
of the degree of rational maps between curves
J. Rafael
Sendra, Franz Winkler
Pages: 317 - 322 > full text |
|
| |
| |
Fast
computation of linear generators for matrix sequences and application to
the block Wiedemann algorithm
Emmanuel Thomé
Pages: 323 - 331 > full text |
|
| |
| |
Irreducible
trinomials over finite fields
Joachim von zur Gathen
Pages: 332 - 336 > full text |
|
| |
| |
IAMC
architecture and prototyping: a progress report
P. Wang,
S. Gray, N. Kajler, D. Lin, W. Liao, X. Zou
Pages: 337 -
344 > full text |
|
| |
| |
On
computational properties of chains of recurrences
Eugene
V. Zima
Page: 345 > full text |
|
| |
