EUROSAM 84

International Symposium on Symbolic and Algebraic Computation Cambridge, England, July 9–11, 1984

Editors:

ISBN: 978-3-540-13350-6 (Print) 978-3-540-38893-7 (Online)

Table of contents (38 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-1

    Introduction

  3. No Access

    Book Chapter

    Pages 2-12

    Homogeneous linear difference equation (Frobenius — Boole method)

  4. No Access

    Book Chapter

    Pages 13-22

    An experiment toward a general quadrature for second order linear ordinary differential equations by symbolic computation

  5. No Access

    Book Chapter

    Pages 23-34

    Operational calculus techniques for solving differential equations

  6. No Access

    Book Chapter

    Pages 35-46

    On the application of symbolic computation to nonlinear control theory

  7. No Access

    Book Chapter

    Pages 47-58

    Quartic equations and algorithms for riemann tensor classification

  8. No Access

    Book Chapter

    Pages 59-63

    Symbolic computation and the Dirichlet problem

  9. No Access

    Book Chapter

    Pages 64-73

    Simplification of polynomials in n variables

  10. No Access

    Book Chapter

    Pages 74-85

    On the equivalence of hierarchical and non-hierarchical rewriting on conditional term rewriting systems

  11. No Access

    Book Chapter

    Pages 86-99

    Implementation of a p-adic package for polynomial factorization and other related operations

  12. No Access

    Book Chapter

    Pages 100-107

    Computations on curves

  13. No Access

    Book Chapter

    Pages 108-114

    Detecting torsion divisors on curves of genus 2

  14. No Access

    Book Chapter

    Pages 115-122

    Computation in radical extensions

  15. No Access

    Book Chapter

    Pages 123-147

    A primer: 11 Keys to new scratchpad

  16. No Access

    Book Chapter

    Pages 148-158

    A pure and really simple initial functional algebraic language

  17. No Access

    Book Chapter

    Pages 159-171

    Some effectivity problems in polynomial ideal theory

  18. No Access

    Book Chapter

    Pages 172-183

    Upper and lower bounds for the degree of Groebner bases

  19. No Access

    Book Chapter

    Pages 184-194

    On the complexity of the Gröbner-bases algorithm over K[x,y,z]

  20. No Access

    Book Chapter

    Pages 195-206

    Algorithms for computing Gröbner bases of polynomial ideals over various Euclidean rings

  21. No Access

    Book Chapter

    Pages 207-212

    Computations with rational subsets of confluent groups

previous Page of 2