Skip to main content
SpringerLink
Log in

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

  • Simplification And Algorithm Implementation
  • Conference paper
  • First Online:
EUROSAM 84 (EUROSAM 1984)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 174))

Included in the following conference series:

Abstract

The design and implementation of a p-adic package, called P-pack, for polynomial factorization, ged, squarefree decomposition and univariate partial fraction expansion are presented. P-pack is written in FRANZ LISP, and can be loaded into VAXIMA and run without modification. The physical organization of the code modules and their logical relations are described. Sharing of code among different modules and techniques for improved speed are discussed.

Work reported herein has been supported in part by the National Science Foundation under Grant MCS 82-01239, and in part by the Department of Energy under Grant DE-AC02-ER7602075-A010.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berlekamp, E. R.: Factoring Polynomials over Finite Fields. Bell System Tech. J., vol. 46, 1853–1859 (1967).

    Google Scholar 

  2. Berlekamp, E. R.: Factoring polynomials over large finite fields. Math. Comp., vol. 24, 713–735 (1970).

    Google Scholar 

  3. Davenport, J.: Factorisation of sparse polynomials. Proceedings, ACM EUROSAM'83 Conference, Kingston Polytechnic, Kingston, England, Mar. 28–30 (1983).

    Google Scholar 

  4. Foderaro, J. K., Fateman, R. J.: Characterization of VAX Macsyma. Proceedings of the 1981 ACM Symposium on Symbolic and Algebraic Computation, 14–19.

    Google Scholar 

  5. Foderaro, J. K., Sklower, K. L.: The FRANZ LISP manual, UNIX Programmer's Manual, vol. 2C, Dept. Electrical Eng. and Computer Science, University of California at Berkeley, 1981.

    Google Scholar 

  6. Kaltofen, E.: Factorization of Polynomials. Computer Algebra-Symbolic and Algebraic Computation, Computing, Suppl. 4, Springer-Verlag, 95–113 (1982).

    Google Scholar 

  7. Knuth, D. E.: The Art of Computer Programming, vol. 2:Seminumerical Algorithms, 2nd ed., Addison-Wesley, Reading, Mass., USA, 1980.

    Google Scholar 

  8. Mignotte, M.: Some Useful Bounds. Computer Algebra-Symbolic and Algebraic Computation, Computing, Suppl. 4, Springer-Verlag, 259–263 (1982).

    Google Scholar 

  9. Moore, P. M. A., Norman, A. C.: Implementing a Polynomial Factorization and GCD Package. Proceedings of the 1981 ACM Symposium on Symbolic and Algebraic Computation, 109–116.

    Google Scholar 

  10. Moses, J., Yun, D. Y. Y.: The EZGCD Algorithm. Proceedings, 1973 ACM National Conference, 159–166.

    Google Scholar 

  11. Musser, D. R.: Multivariate Polynomial Factorization. JACM, vol. 22, 291–308 (1976).

    Google Scholar 

  12. Wang, P. S.: An Improved Multivariate Polynomial Factoring Algorithm. Mathematics of Computation, vol. 32, No. 144, 1215–1231 (1978).

    Google Scholar 

  13. Wang, P. S., Trager, B. M.: New Algorithms for Polynomial Square-free Decomposition over the Integers. SIAM J. Computing, vol. 8, No. 3, 300–305 (1979).

    Google Scholar 

  14. Wang, P. S.: Parallel p-adic Constructions in the Univariate Polynomial Factoring Algorithm. Proceedings, MACSYMA Users' Conference, Cambridge, MA, MIT 310–318 (1979).

    Google Scholar 

  15. Wang, P. S.: The EEZ-GCD Algorithm. SIGSAM Bulletin, vol. 14, No. 2, 50–60 (1980).

    Google Scholar 

  16. Wang, P. S.: A p-adic Algorithm for Univariate Partial Fractions. Proceedings of the 1981 ACM symposium on Symbolic and Algebraic Computation, Snowbird, Utah, 212–217.

    Google Scholar 

  17. Wang, P. S., Guy, M., Davenport, J.: p-adic Reconstruction of Rational Numbers. ACM SIGSAM Bulletin, vol. 16, 2–3 (1982).

    Google Scholar 

  18. Wang, P. S.: Early Detection of True Factors in Univariate Polynomial Factorization. Proceedings, ACM EUROSAM '83, London, March 28–30, 1983, 225–235.

    Google Scholar 

  19. Wang, P. S.: Factoring Multivariate Polynomials over Algebraic Number Fields. math. comp., vol. 30, 324–336 (1976).

    Google Scholar 

  20. Zipple, R. E.: Newton's Iteration and the Sparse Hensel Algorithm. ACM SYMSAC, 68–72 (1981).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Kent State University, 44242, Kent, Ohio

    Paul S. Wang

Authors
  1. Paul S. Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John Fitch

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, P.S. (1984). Implementation of a p-adic package for polynomial factorization and other related operations. In: Fitch, J. (eds) EUROSAM 84. EUROSAM 1984. Lecture Notes in Computer Science, vol 174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032833

Download citation

  • DOI: https://doi.org/10.1007/BFb0032833

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13350-6

  • Online ISBN: 978-3-540-38893-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation