skip to main content
article
Free Access

Symbolic mathematical computation in a Ph. D. computer science program

Published:01 March 1972Publication History
First page image

References

  1. B. F. Caviness, A Lehmer-type Greatest Common Divisor Algorithm for Gaussian Integers, (In preparation).Google ScholarGoogle Scholar
  2. B. F. Caviness, M. R. Newton and T. P. Vaughan, The SAC-1 Gaussian-Integer Arithmetic and Polynomial System, (In preparation).Google ScholarGoogle Scholar
  3. G. E. Collins, Algebraic Algorithms (In preparation).Google ScholarGoogle Scholar
  4. G. E. Collins, Computing Multiplication Inverses in GF(p), Math, Comp., Vol. 23, No. 105 (Jan. 1969), pp. 197--200.Google ScholarGoogle Scholar
  5. G. E. Collins, The SAC-1 List Processing System, University of Wisconsin Computer Sciences Dept. Tech. Report #129 (July 1971), 34 pages.Google ScholarGoogle Scholar
  6. G. E. Collins, et al, The SAC-1 Modular Arithmetic System, University of Wisconsin Computing Center Technical Report #10 (June 1969), 50 pages.Google ScholarGoogle Scholar
  7. G. E. Collins and D. R. Musser, Analysis of the Pope-Stein Division Algorithm, University of Wisconsin Computer Sciences Department Technical Report #55 (Jan. 1969), 10 pages.Google ScholarGoogle Scholar
  8. G. E. Collins and J. R. Pinkert, The Revised SAC-1 Integer Arithmetic System, University of Wisconsin Computing Center Technical Report #9 (Nov. 1968), 50 pages.Google ScholarGoogle Scholar
  9. J. D. Dixon, The Number of Steps in the Euclidean Algorithm, Jour. Number Theory, Vol. 2 (1970), pp. 414--422.Google ScholarGoogle ScholarCross RefCross Ref
  10. J. D. Dixon, A Simple Estimate for the Number of Steps in the Euclidean Algorithm, Amer. Math. Monthly, Vol. 78, No. 4 (April 1971), pp. 374--376.Google ScholarGoogle ScholarCross RefCross Ref
  11. P. Henrici, A Subroutine for Computations with Rational Numbers, Jour. ACM, Vol. 3, No. 1 (Jan. 1956), pp. 6--9. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. E. Horowitz, Modular Arithmetic and Finite Field Theory: A Tutorial, Proc. of the Second Symposium on Symbolic and Algebraic Manipulation (March 1971), pp. 188--194. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. D. E. Knuth, Seminumerical Algorithms, The Art of Computer Programming, Vol. II, Addison-Wesley Publishing Co., Reading, Mass., 1969, pp. 229--360. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. D. E. Knuth, The Art of Computer Programming-Errata et Addenda, Stanford University Computer Science Department Technical Report #STAN-CS-71--194 (Jan. 1971), 28 pages.Google ScholarGoogle Scholar
  15. D. E. Knuth, Mathematical Analysis of Algorithms, Stanford University Computer Science Department Technical Report #STAN-CS-71--206 (March 1971), 26 pages.Google ScholarGoogle Scholar
  16. R. E. Moore, Interval Analysis, Prentice-Hall, Inc., Englewood Cliffs, N. J., 1966.Google ScholarGoogle Scholar
  17. W. S. Brown, On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors, Jour. ACM, Vol. 18, No. 4 (Oct. 1971), pp. 478--504. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. W. S. Brown and J. F. Traub, On Euclid's Algorithm and the Theory of Subresultants, Jour. ACM, Vol. 18, No. 4 (Oct. 1971), pp. 505--514. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. G. E. Collins, The SAC-1 Polynomial System, University of Wisconsin Computer Sciences Department Technical Report #115 (March 1971), 66 pages.Google ScholarGoogle Scholar
  20. G. E. Collins, The SAC-1 Polynomial GCD and Resultant System (In preparation).Google ScholarGoogle Scholar
  21. G. E. Collins, Subresultants and Reduced Polynomial Remainder Sequences, Jour. ACM, Vol. 14, No. 1 (Jan. 1967), pp. 128--142. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. G. E. Collins, et al, The SAC-1 Modular Arithmetic System, University of Wisconsin Computing Center Technical Report #10 (June 1969), 50 pages.Google ScholarGoogle Scholar
  23. G. E. Collins, The Calculation of Multivariate Polynomial Resultants, Jour. ACM, Vol. 18, No. 4 (Oct. 1971), pp. 515--532. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. I. N. Herstein, Topics in Algebra, Ginn & Co., Waltham, 1964.Google ScholarGoogle Scholar
  25. N. Jacobson, Lectures in Abstract Algebra, Vol. 1 (Basic Concepts), D. Van Nostrand Co., New York, 1951.Google ScholarGoogle Scholar
  26. D. E. Knuth, The Art of Computer Programming, Vol. 1 (1968), Vol. II (1969), Addison-Wesley, Reading, Mass. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. J. D. Lipson, Chinese Remainder and Interpolation Algorithms, Proc. of the Second Symposium on Symbolic and Algebraic Manipulation (March 1971), pp. 372--391. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. B. L. van der Waerden, Modern Algebra, Vol. I, Ungar Publ. Co., New York, 1953 (second ed.).Google ScholarGoogle Scholar
  29. E. H. Bareiss, Computational Solutions of Matrix Problems over an Integral Domain, Argonne National Laboratory Tech. Memo. No. 222 (Dec. 1970), 76 pages.Google ScholarGoogle Scholar
  30. E. R. Berlekamp, Algebraic Coding Theory, McGraw-Hill, New York, 1968.Google ScholarGoogle Scholar
  31. E. R. Berlekamp, Factoring Polynomials over Large Finite Fields, Math. Comp., Vol. 24, No. 111 (July 1970), pp. 713--735.Google ScholarGoogle ScholarCross RefCross Ref
  32. I. Borosh and A. S. Fraenkel, Exact Solutions of Linear Equations with Rational Coefficients by Congruence Techniques, Math. Comp., Vol. 20, No. 93 (Jan. 1966), pp. 107--112.Google ScholarGoogle Scholar
  33. S. Cabay, Exact Solution of Linear Equations, Proc. of the Second Symposium on Symbolic and Algebraic Manipulation (March 1971), pp. 392--398. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. G. E. Collins and L. E. Heindel, The SAC-1 Polynomial Real Zero System, University of Wisconsin Computer Sciences Department Technical Report #93 (August 1970), 72 pages.Google ScholarGoogle Scholar
  35. G. E. Collins, The SAC-1 Rational Function System, University of Wisconsin Computer Sciences Department Technical Report #135 (Sept. 1971), 31 pages.Google ScholarGoogle Scholar
  36. G. E. Collins and M. T. McClellan, The SAC-1 Polynomial Linear Algebra System, University of Wisconsin Computer Sciences Department Technical Report (In preparation).Google ScholarGoogle Scholar
  37. G. E. Collins and D. R. Musser, The SAC-1 Polynomial Factorization system, University of Wisconsin Computer Sciences Department Technical Report (In preparation).Google ScholarGoogle Scholar
  38. L. E. Heindel, Algorithms for Exact Polynomial Root Calculation, Ph. D. Thesis, University of Wisconsin Computer Sciences Department, Aug. 1970, 153 pages. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. L. E. Heindel, Integer Arithmetic Algorithms for Polynomial Real Zero Determination, Jour. ACM, Vol. 18, No. 4 (Oct. 1971), pp. 533--548. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. J. A. Howell and R. T. Gregory, An Algorithm for Solving Linear Algebraic Equations Using Residue Arithmetic, BIT, Vol. 9 (1969), pp. 200--224 and pp. 324--337.Google ScholarGoogle Scholar
  41. J. A. Howell and R. T. Gregory, Solving Systems of Linear Algebraic Equations Using Residue Arithmetic, BIT, Vol. 10 (1970), pp. 23--27.Google ScholarGoogle Scholar
  42. D. E. Knuth, The Art of Computer Programming, Vol. I (1968), Vol. II (1969), Addison-Wesley, Reading, Mass. Google ScholarGoogle ScholarDigital LibraryDigital Library
  43. M. Marden, The Geometry of Zeros of a Polynomial in a Complex Variable, Mathematical Surveys No. III, Amer. Math. Soc., Providence, 1949.Google ScholarGoogle Scholar
  44. M. T. McClellan, The Exact Solution of Systems of Linear Equations with Polynomial Coefficients, University of Wisconsin Computer Sciences Department Technical Report #136 (Sept. 1971), Ph. D. Thesis, 258 pages.Google ScholarGoogle ScholarDigital LibraryDigital Library
  45. D. R. Musser, Algorithms for Polynomial Factorization, University of Wisconsin Computer Sciences Department Technical Report #139 (Sept. 1971), Ph. D. Thesis, 174 pages. Google ScholarGoogle ScholarDigital LibraryDigital Library
  46. H. Zassenhaus, On Hensel Factorization I, Jour. Number Theory, Vol. 1 (1969), pp. 291--311.Google ScholarGoogle ScholarCross RefCross Ref
  47. W. S. Brown, Rational Exponential Expressions and a Conjecture Concerning π and e, Amer. Math. Monthly, Vol. 76, No. 1 (Jan. 1969), pp. 28--34.Google ScholarGoogle Scholar
  48. B. F. Caviness, On Canonical Forms and Simplification, Jour. ACM, Vol. 17, No. 2 (April 1970), pp. 385--396. Google ScholarGoogle ScholarDigital LibraryDigital Library
  49. B. F. Caviness, M. R. Newton and T. P. Vaughan, The SAC-1 Gaussian-Integer Arithmetic and Polynomial System, (In preparation).Google ScholarGoogle Scholar
  50. B. F. Caviness, P. L. Pollack and C. M. Rubald, An Existence Lemma for Canonical Forms in Symbolic Mathematics, Info. Proc. Letters, Vol. 1 (1971), pp. 45--46.Google ScholarGoogle ScholarDigital LibraryDigital Library
  51. G. E. Collins and E. Horowitz, The SAC-1 Partial Fraction Decomposition and Rational Function Integration System, University of Wisconsin, Computer Sciences Department Report #80 (Feb. 1970), 47 pages.Google ScholarGoogle Scholar
  52. M. Davis, Computability and Unsolvability, McGraw-Hill Book Company, Inc., New York, 1958.Google ScholarGoogle Scholar
  53. E. Horowitz, Algorithms for Partial Fraction Decomposition and Rational Function Integration, Proc. of the Second Symposium on Symbolic and Algebraic Manipulation (March 1971), pp. 441--457. Google ScholarGoogle ScholarDigital LibraryDigital Library
  54. E. Horowitz, Algorithms for Symbolic Integration of Rational Functions, Ph. D. Thesis, University of Wisconsin Computer Sciences Department (Nov. 1969), 132 pages.Google ScholarGoogle Scholar
  55. S. C. Johnson, On the Problem of Recognizing Zero, Jour. ACM, Vol. 18, No. 4 (Oct. 1971), pp. 559--565. Google ScholarGoogle ScholarDigital LibraryDigital Library
  56. Ju. V. Matijasevic, Enumerable Sets are Diophantine, Soviet Math. Dokl., Vol. 11 (1970).Google ScholarGoogle Scholar
  57. J. Moses, Symbolic Integration: The Stormy Decade, Comm. ACM, Vol. 14, No. 8 (Aug. 1971), pp. 548--560. Google ScholarGoogle ScholarDigital LibraryDigital Library
  58. D. Richardson, Some Unsolvable Problems Involving Elementary Functions of a Real Variable, J. Symbolic Logic, Vol. 33 (1968), pp. 514--520.Google ScholarGoogle ScholarCross RefCross Ref
  59. D. Richardson, Solution of the Identity Problem for Integral Exponential Functions, Zeitschr. Math. Logik, Vol. 15 (1969), pp. 333--340.Google ScholarGoogle ScholarCross RefCross Ref
  60. R. H. Risch, The Problem of Integration in Finite Terms, Trans. Amer. Math. Soc., Vol. 139 (May 1969), pp. 167--189.Google ScholarGoogle ScholarCross RefCross Ref
  61. R. H. Risch, The Solution of the Problem of Integration in Finite Terms, Bull. Amer. Math. Soc., Vol. 76 (May 1970), pp. 605--608.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

(auto-classified)
  1. Symbolic mathematical computation in a Ph. D. computer science program

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM SIGCSE Bulletin
        ACM SIGCSE Bulletin  Volume 4, Issue 1
        March 1972
        159 pages
        ISSN:0097-8418
        DOI:10.1145/873684
        Issue’s Table of Contents

        Copyright © 1972 Authors

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 March 1972

        Check for updates

        Qualifiers

        • article
      • Article Metrics

        • Downloads (Last 12 months)11
        • Downloads (Last 6 weeks)1

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!