Journal of symbolic computation

• 

  Año 2002, Vol. 33, Número 5

  • Preface

    Gilles Villard

    pág. 519

    

  • Rational Normal Forms and Minimal Decompositions of Hypergeometric Terms

    M. Petkovsek, S. A. Abramov

    págs. 521-543

    

  • On Multivariate Rational Function Decomposition

    David Sevilla González, María del Rosario Rubio San Miguel, Jaime Gutiérrez Gutiérrez

    págs. 545-562

    

  • Scalable Parallel Coset Enumeration: Bulk Definition and the Memory Wall

    Victor Grinberg, Gene Cooperman

    págs. 563-585

    

  • Hybrid Sparse Resultant Matrices for Bivariate Polynomials

    Ioannis Z. Emiris, Carlos D'Andrea

    págs. 587-608

    

  • Derivations and Radicals of Polynomial Ideals over Fields of Arbitrary Characteristic

    P. Gianni, B. Trager, Elisabetta Fortuna

    págs. 609-625

    

  • An Iterated Eigenvalue Algorithm for Approximating Roots of Univariate Polynomials

    Steven Fortune

    págs. 627-646

    

  • On Computer-assisted Classification of Coupled Integrable Equations

    Marc Moreno Maza, Mikhail V. Foursov

    págs. 647-660

    

  • Irreducible Decomposition of Curves

    André Galligo, David Rupprecht

    págs. 661-677

    

  • Relations Between Roots and Coefficients, Interpolation and Application to System Solving

    Olivier Ruatta, Bernard Mourrain

    págs. 679-699

    

  • Univariate Polynomials: Nearly Optimal Algorithms for Numerical Factorization and Root-finding

    Victor Y. Pan

    págs. 701-733

    

  • A Probabilistic Algorithm to Test Local Algebraic Observability in Polynomial Time

    Alexandre Sedoglavic

    págs. 735-755

    

  • Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm

    Emmanuel Thomé

    págs. 757-775