Journal of symbolic computation

• 

  Año 1993, Vol. 15, Número 1

  • Compiling Pattern Matching by Term Decomposition

    Ascander Suarez, Laurence Puel

    págs. 1-26

    

  • Implementing CLP(𝔹) using the Connection Theorem Proving Method and a Clause Management Systems

    págs. 27-48

    

  • Transitivity for Weak and Strong Gröbner Bases

    A. Boyle, W. W. Adams, P. Loustaunau

    págs. 49-65

    

  • The Equivalence Problem for Finite Rings

    John Lawrence, Stanley Burris

    págs. 67-71

    

  • The Study of Motion for a Gyroscope with Gimbal Suspension: Obtaining the Highest Approximations for a Drift of Magnus

    V. V. Leonov, V. M. Rudenko, D. M. Klimov

    págs. 73-78

    

  • Computer Algebra Techniques in Affinity Binding Equations: the Dimer Case

    J. P. Bennett, J. Hubble, M. Grinfeld

    págs. 79-83

    

  • Computer Classification of the Integrable Coupled Kdv-like Systems with Unit Main Matrix

    págs. 85-90

    

  • Symbolically Precise Solutions to a Homogeneous Second Order Matrix Ordinary Differential Equation with Macsyma

    págs. 91-98