Advertisement

Radical simplification using algebraic extension fields

  • Trevor J. Smedley
Polynomial Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 378)

References

  1. 1.
    B.F. Caviness and R.J. Fateman, “Simplification of Radical Expressions,” Proceedings SYMSAC 1976, pp. 329–338 Association for Computing Machinery, (1976).Google Scholar
  2. 2.
    B.W. Char, K.O. Geddes, G.H. Gonnet, and S.M. Watt, Maple User's Guide, WATCOM (1985).Google Scholar
  3. 3.
    G.H. Gonnet, “New Results for Random Determination of Equivalence of Expressions,” Proceedings SYMSAC '86, pp. 127–131 Association for Computing Machinery, (1986).Google Scholar
  4. 4.
    R.E. Moore, Interval Analysis, Prentice-Hall (1966).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Trevor J. Smedley
    • 1
  1. 1.University of WaterlooCanada

Personalised recommendations