Journal of symbolic computation

• 

  Año 2003, Vol. 36, Número 3

  • Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation

    Arthur D. Chtcherba, D. Kapur

    págs. 289-315

    

  • Multihomogeneous resultant formulae by means of complexes

    Ioannis Z. Emiris, Alicia Dickenstein

    págs. 317-342

    

  • Algorithms to compute the topology of orientable real algebraic surfaces

    P. Parenti, C. Traverso, Elisabetta Fortuna, P. Gianni

    págs. 343-364

    

  • Early termination in sparse interpolation algorithms

    W.-S. Lee, Erich Kaltofen

    págs. 365-400

    

  • Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases

    W.-S. Lee, Erich Kaltofen, Mark Giesbrecht

    págs. 401-424

    

  • The resultant of an unmixed bivariate system

    Amit Khetan

    págs. 425-442

    

  • Factoring systems of linear PDEs with finite-dimensional solution spaces

    Serguei P. Tsarev, Fritz Schwarz, Ziming Li

    págs. 443-471

    

  • Fast computation of discrete invariants associated to a differential rational mapping

    G. Matera, Alexandre Sedoglavic

    págs. 473-499

    

  • Moving frames

    Peter J. Olver

    págs. 501-512

    

  • Towards faster real algebraic numbers

    Renaud Rioboo

    págs. 513-533

    

  • Simplification of surface parametrizations¿a lattice polygon approach

    Josef Schicho

    págs. 535-554

    

  • Complexity results for triangular sets

    Aric Schost

    págs. 555-594

    

  • Computing in algebraic geometry and commutative algebra using Macaulay 2

    Michael Stillman

    págs. 595-611

    

  • High-order lifting and integrality certification

    Arne Storjohann

    págs. 613-648

    

  • An alternative approach to comprehensive Gröbner bases

    Akira Suzuki, Yosuke Sato

    págs. 649-667

    

  • Canonical comprehensive Gröbner bases

    Volker Weispfenning

    págs. 669-683