Advertisement

Fast Boolean Matrix Multiplication for Highly Clustered Data

  • Andreas Björklund
  • Andrzej Lingas
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2125)

Abstract

We consider the problem of computing the product of two n×n Boolean matrices A and B. For an n ×n Boolean matrix C, let G C be the complete weighted graph on the rows of C where the weight of an edge between two rows is equal to its Hamming distance, i.e., the number of entries in the first row having values different from the corresponding entries in the second one. Next, let MWT(C) be the weight of a minimum weight spanning tree of G C. We show that the product of A with B as well as the so called witnesses of the product can be computed in time õ(n(n + minMWT(A),MWT(B t )))1.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A.V. Aho, J.E. Hopcroft and J.D. Ullman. The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, Massachusetts, 1974).MATHGoogle Scholar
  2. 2.
    N. Alon and M. Naor. Derandomization, Witnesses for Boolean Matrix Multiplication and Construction of Perfect hash functions. Algorithmica 16, pp. 434–449, 1996.MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    J. Basch, S. Khanna and R. Motwani. On Diameter Verification and Boolean Matrix Multiplication. Technical Report, Standford University CS department, 1995.Google Scholar
  4. 4.
    P.J. Cameron. Combinatorics. Cambridge University Press 1994.Google Scholar
  5. 5.
    D. Coppersmith and S. Winograd. Matrix Multiplication via Arithmetic Progressions. J. of Symbolic Computation 9 (1990), pp. 251–280.MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Z. Galil and O. Margalit. Witnesses for Boolean Matrix Multiplication and Shortest Paths. Journal of Complexity, pp. 417–426, 1993.Google Scholar
  7. 7.
    P. Indyk and R. Motwani. Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. Proceedings of the 30th ACM Symposium on Theory of Computing, 1998.Google Scholar
  8. 8.
    P. Indyk, S.E. Schmidt, and M. Thorup. On reducing approximate mst to closest pair problems in high dimensions. Manuscript, 1999.Google Scholar
  9. 9.
    C.P. Schnorr and C.R. Subramanian. Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter. Randomization and Approximation Techniques in Computer Science. Second International Workshop, RANDOM’98, Lecture Notes in Computer Science 1518, pp. 218–231.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Andreas Björklund
    • 1
  • Andrzej Lingas
    • 2
  1. 1.Department of Computer ScienceLund Institute of TechnologyLund
  2. 2.Department of Computer ScienceLund UniversityLund

Personalised recommendations