Skip to main content

Solving diophantine equations on a network of workstations

  • 5. Posters
  • Conference paper
  • First Online:
High-Performance Computing and Networking (HPCN-Europe 1998)

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

Included in the following conference series:

  • 247 Accesses

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

Access this chapter

Institutional subscriptions

References

  1. N. D. Elkies. On A4 + B4 + C4 = D4. Mathematics of Computation, 51, 1988, pp. 825–835.

    Google Scholar 

  2. I. Foster. Designing and Building Parallel Programs. Addison-Wesley, 1995.

    Google Scholar 

  3. R. K. Guy. Unsolved Problems in Number Theory. Springer-Verlag, 1994.

    Google Scholar 

  4. L. J. Lander, T. R. Parkin and J. L. Selfridge. A Survey of Equal Sums of Like Powers. Mathematics of Computation, 21, 1967, pp. 446–459.

    Google Scholar 

  5. R. Sakellariou. On Equal Sums of Like Powers, unpublished manuscript. See also http://www.cs.man.ac.uk/cnc/EqualSums/

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Peter Sloot Marian Bubak Bob Hertzberger

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sakellariou, R. (1998). Solving diophantine equations on a network of workstations. In: Sloot, P., Bubak, M., Hertzberger, B. (eds) High-Performance Computing and Networking. HPCN-Europe 1998. Lecture Notes in Computer Science, vol 1401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037225

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64443-9

  • Online ISBN: 978-3-540-69783-1

  • eBook Packages: Springer Book Archive

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Publish with us

Policies and ethics