Skip to main content
SpringerLink
Log in

Fast matrix multiplication by boolean RAM in linear storage

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1978 (MFCS 1978)

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

  • 134 Accesses

Abstract

Two-dimensional Boolean RAM (random access machine with Boolean operations and shifts) can speed the results and lower the costs that appear in performing two-dimensional computations such as matrix manipulation. This paper presents an implementation of a fast algorithm for matrix multiplication; the product of (m,m)-matrices A and B with 0 ≤ aij, bij ≤ k−1, for all 1 ≤ i,j ≤ m, is computed in 0(m·log2k (log2m + log2k)) steps in linear storage.

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. E. ENGELER. The Theory of Computation. Academic Press, New York 1973

    Google Scholar 

  2. A.HÜBLER. Algorithmen für konkrete Bildtransformationsaufgaben in TSE-RASP. FSU Jena BASM-77/4, November 1977

    Google Scholar 

  3. R.KLETTE. TSE-RASP. Entwurf eines Modells zur Programmierung von Bildtransformationen. FSU Jena BASM-77/1, September 1977

    Google Scholar 

  4. R.KLETTE, R.LINDNER. Entscheidbarkeitsprobleme in der Aussagenlogik. Das Leistungsvermögen zweidimensional arbeitender Vektormaschinen. FSU Jena BASM-77/6, Dezember 1977

    Google Scholar 

  5. R.KLETTE. Aufgabe 6. FSU Jena BASM-77/7, Dezember 1977

    Google Scholar 

  6. R.LINDNER. Zur TSE-RASP-Realisierung von Klassen homogener Image-Funktionen. FSU Jena BASM-77/2, Oktober 1977

    Google Scholar 

  7. V.R. PRATT, L.J. STOCKMEYER. A Characterization of the Power of Vector Machines. J.Comput. System Sci.12(1976) 198–221

    Google Scholar 

  8. D.H.SCHAEFER, J.P.STRONG. Tse Computers. Goddard SFC Report X-943-75-14, January 1975

    Google Scholar 

  9. J.SEIFERAS, R.WEICKER. Linear-time simulation of an iterative array of finite-state machines by a boolean RAM with uniform cost criterion. Comput. Sci. Dep.University Park Report 201, July 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Friedrich - Schiller, Universität Jena Sektion Mathematik, Universitätshochhaus 17.0G, DDR - 69, Jena

    Reinhard Klette

Authors
  1. Reinhard Klette
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Winkowski

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klette, R. (1978). Fast matrix multiplication by boolean RAM in linear storage. In: Winkowski, J. (eds) Mathematical Foundations of Computer Science 1978. MFCS 1978. Lecture Notes in Computer Science, vol 64. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08921-7_78

Download citation

  • DOI: https://doi.org/10.1007/3-540-08921-7_78

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-35757-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation