Functions equivalent to integer multiplication

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 85)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Aho A. V., Hopcroft J. E., Ullman J. D.: "The Design and Analysis of Computer Algorithms" Addison-Wesley, 1974.Google Scholar
  2. [2]
    Alt H.: "Algorithms for Square Root Extraction" Report A77–12, Fachbereich Angew. Mathematik und Informatik, Saarbrücken, 1977.Google Scholar
  3. [3]
    Alt H.: "Square Rooting is as Difficult as Multiplication" Computing 21, 221–232, (1979).Google Scholar
  4. [4]
    Alt H.: "Functions Equivalent to Integer Multiplication," Report CS-80-8, The Pennsylvania State University, (1980).Google Scholar
  5. [5]
    Borodin A., Munroe I.: "The Computational Complexity of Algebraic and Numeric Problems" Elsevier Comp. Sc. Library, 1975.Google Scholar
  6. [6]
    Cook S. A., Anderaa, S. O.: "On the minimum complexity of functions" Trans. Amer. Math. Soc. 142, 291–314, (1969).Google Scholar
  7. [7]
    Knuth D. E.: "The Art of Computer Programming" Vol. 2, Addison-Wesley, 1969.Google Scholar
  8. [8]
    Schönhage A.: "Schnelle Berechnung von Kettenbruchentwicklungen" Acta Informatica 1, 139–144, (1971).Google Scholar
  9. [9]
    Schönhage A., Strassen V.: "Schnelle Multiplikation grosser Zahlen" Computing 7, 281–292, (1971).Google Scholar
  10. [10]
    Toom A. L.: "The Complexity of a Scheme of Functional Elements Realizing the Multiplication of Integers" Soviet Math. Dokl. 4, 714–716, (1963).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • H. Alt
    • 1
  1. 1.Department of Computer ScienceThe Pennsylvania State UniversityUniversity Park

Personalised recommendations