Journal of Symbolic Computation, Volume 37, 2004

Volume 37, Number 1, January 2004

Guillem Godoy, Robert Nieuwenhuis:
Superposition with completely built-in Abelian groups. 1-33
Wayne Eberly, Mark Giesbrecht:
Efficient decomposition of separable algebras. 35-81
Zeng Guangxing, Zeng Xiaoning:
An effective decision method for semidefinite polynomials. 83-99
Mao-Ching Foo, Eng-Wee Chionh:
Corner edge cutting and Dixon A-resultant quotients. 101-119

Computer Algebra and Signal Processing

Jeremy R. Johnson, José M. F. Moura, Markus Püschel, Daniel N. Rockmore:
Special issue on computer algebra and signal processing: forward by the guest editors. 133-135
Michael Clausen, Meinard Müller:
Generating fast Fourier transforms of solvable groups. 137-156
Sebastian Egner, Markus Püschel:
Symmetry-based matrix factorization. 157-186
Richard Foote, Gagan Mirchandani, Daniel N. Rockmore:
Two-dimensional wreath product group-based image processing. 187-207
Hyungju Park:
Symbolic computation and signal processing. 209-226
Jérôme Lebrun, Ivan W. Selesnick:
Gröbner bases and wavelet design. 227-259
Jeremy R. Johnson, Anthony F. Breitzman:
Automatic derivation and implementation of fast convolution algorithms. 261-293

Edoardo Ballico, Ferruccio Orecchia:
Computing minimal generators of the ideal of a general projective curve. 295-304
Serge Burckel:
Elementary decompositions of arbitrary maps over finite sets. 305-310
Ioannis Th. Famelis, S. N. Papakostas, Ch. Tsitouras:
Symbolic derivation of Runge-Kutta order conditions. 311-327
Stefan Andrei, Wei-Ngan Chin:
Solving a class of higher-order equations over a group structure. 329-341
Friedrich Otto, Olga Sokratova:
Reduction relations for monoid semirings. 343-376
Min-Ho Ahn, Gwang-Il Kim:
Characterization of Pythagorean curves and Pythagoreanization using a rational transform. 377-389
Guillaume Hanrot, Paul Zimmermann:
A long note on Mulders' short product. 391-401
Juan Migliore, Chris Peterson:
A symbolic test for (i, j)-uniformity in reduced zero-dimensional schemes. 403-413

Andrew V. Sills:
a Maple package for aiding the discovery and proof of finite Rogers-Ramanujan type identities. 415-448
Hoon Hong:
Note on Jacobi's method for approximating dominant roots. 449-453
Alberto Oliart, Wayne Snyder:
Fast algorithms for uniform semi-unification. 455-484
Thom Mulders, Arne Storjohann:
Certified dense linear system solving. 485-510
Hervé Perdry:
Strongly Noetherian rings and constructive ideal theory. 511-535
Hongbo Shi:
Computation of the finitistic dimension of monomial algebras. 537-546

Nicolas Rennert:
A parallel multi-modular algorithm for computing Lagrange resolvents. 547-556
David Rupprecht:
Semi-numerical absolute factorization of polynomials with integer coefficients. 557-574
Edgar Martínez-Moro:
Regular representations of finite-dimensional separable semisimple algebras and Gróbner bases. 575-587
John J. Cannon, Derek F. Holt:
Computing maximal subgroups of finite groups. 589-609
Kouichi Hirata, Keizo Yamada, Masateru Harao:
Tractable and intractable second-order matching problems. 611-628
Jose Maria Ucha-Enréquez, Francisco Jesus Castro-Jiménez:
On the computation of Bernstein-Sato ideals. 629-639
Karim Belabas:
A relative van Hoeij algorithm over number fields. 641-668

Douglas Baldwin, Ünal Göktas, Willy Hereman, L. Hong, R. S. Martino, J. C. Miller:
Symbolic computation of exact solutions expressible in hyperbolic and elliptic functions for nonlinear PDEs. 669-705
Marcelo P. Fiore, Tom Leinster:
An objective representation of the Gaussian integers. 707-716
Juan Elias:
On the computation of the Ratliff-Rush closure. 717-725
Dan Bernstein:
The computational complexity of rules for the character table of Sn. 727-748
Ana Marco, José-Javier Martínez:
Parallel computation of determinants of matrices with polynomial entries. 749-760
Nick T. Koussoulas, Photis G. Skiadas:
Symbolic computation for mobile robot path planning. 761-775