Table of contents (114 papers)

  1. Front Matter
  2. Algorithms for polynomial division
    Dario Bini, Victor Pan
    Pages 1-3
  3. Sparse hensel lifting
    Erich Kaltofen
    Pages 4-17
  4. Heugcd: How elementary upperbounds generate cheaper data
    James Davenport, Julian Padget
    Pages 18-28
  5. Gaussian elimination over a euclidean ring
    Costas S. Iliopoulos
    Pages 29-30
  6. The SAC-2 computer algebra system
    George E. Collins
    Pages 34-35
  7. DOE-MACSYMA: Progress report
    George J. Carrette, Leo P. Harten
    Pages 36-39
  8. Towards practical implementations of syllogistic
    S. Ghelfo, E. G. Omodeo
    Pages 40-49
  9. Path resolution and semantic graphs
    Neil V. Murray, Erik Rosenthal
    Pages 50-63
  10. Fast subsumption algorithms
    G. Gottlob, A. Leitsch
    Pages 64-77
  11. Progress on the equivalence problem
    J. E. Åman, R. A. d'Inverno, G. C. Joly, M. A. H. MacCallum
    Pages 89-98
  12. Algebraic computations in elementary catastrophe theory
    K. Millington, F. J. Wright
    Pages 116-125
  13. Factorization of polynomials by transcendental evaluation
    Marc-Paul van der Hulst, Arjen K. Lenstra
    Pages 138-145

Other volumes

  1. EUROCAL '85
    European Conference on Computer Algebra Linz, Austria, April 1–3 1985 Proceedings Vol. 1: Invited Lectures
  2. EUROCAL '85
    European Conference on Computer Algebra Linz, Austria, April 1–3 1985 Proceedings Vol. 2: Research Contributions

About these proceedings

Keywords

Resolution algorithms complexity formal specification logic proof

Bibliographic information

  • Copyright Information Springer-Verlag 1985
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-15984-1
  • Online ISBN 978-3-540-39685-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349