Advertisement

An Improved Bound on Boolean Matrix Multiplication for Highly Clustered Data

  • Leszek Gąsieniec
  • Andrzej Lingas
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2748)

Abstract

We consider the problem of computing the product of two n ×n Boolean matrices A and B.

For two 0-1 strings s=s 1 s 2....s m and u=u 1 u 2...u m , an extended Hamming distance, eh(s,u), between the strings, is defined by a recursive equation eh(s,u) = eh(s l + 1...s m , u l + 1...u m ) + (s 1 + u 1 mod 2) where l is the maximum number, s.t., s j =s 1 and u j =u 1 for j=1,...,l. For any n ×n Boolean matrix C, let G C be a complete weighted graph on the rows of C, where the weight of an edge between two rows is equal to its extended Hamming distance. Next, let MWT(C) be the weight of a minimum weight spanning tree of G C . We show that the product of A and B as well as the so called witnesses of the product can be computed in time Õ(n(n + 1 min{MWT(A), MWT(B t )})).

Since the extended Hamming distance between two strings never exceeds the standard Hamming distance between them, our result subsumes an earlier similar result on the Boolean matrix product in terms of the Hamming distance due to Björklund and Lingas [4]. We also observe that min\(\{MWT(A), MWT(B^t)\} = O(min\{r_A, r_B\})\) where r A and r B reflect the minimum number of rectangles required to cover 1s in A and B, respectively. Hence, our result also generalizes the recent upper bound on the Boolean matrix product in terms of r A and r B , due to Lingas [12].

Keywords

Span Tree Search Tree Minimum Span Tree Combinatorial Algorithm Boolean Matrix 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)MATHGoogle Scholar
  2. 2.
    Alon, N., Naor, M.: Derandomization, Witnesses for Boolean Matrix Multiplication and Construction of Perfect hash functions. Algorithmica 16, 434–449 (1996)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Basch, J., Khanna, S., Motwani, R.: On Diameter Verification and Boolean Matrix Multiplication. Technical Report, Standford University CS department (1995) Google Scholar
  4. 4.
    Björklund, A., Lingas, A.: Fast Boolean matrix multiplication for highly clustered data. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol. 2125, p. 258. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  5. 5.
    Borodin, A., Ostrovsky, R., Rabani, Y.: Subquadratic Approximation Algorithms For Clustering Problems in High Dimensional Spaces. In: Proceedings of the 31st ACM Symposium on Theory of Computing (1999)Google Scholar
  6. 6.
    Cameron, P.J.: Combinatorics. Cambridge University Press, Cambridge (1994)MATHGoogle Scholar
  7. 7.
    Coppersmith, D., Winograd, S.: Matrix Multiplication via Arithmetic Progressions. J. of Symbolic Computation 9, 251–280 (1990)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Galil, Z., Margalit, O.: Witnesses for Boolean Matrix Multiplication and Shortest Paths. Journal of Complexity, 417–426 (1993)Google Scholar
  9. 9.
    Indyk, P., Motwani, R.: Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In: Proceedings of the 30th ACM Symposium on Theory of Computing (1998) Google Scholar
  10. 10.
    Indyk, P., Schmidt, S.E., Thorup, M.: On reducing approximate mst to closest pair problems in high dimensions (1999) (manuscript) Google Scholar
  11. 11.
    Kushilevitz, E., Ostrovsky, R., Rabani, Y.: Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM J. Comput. 30(2), 457–474 (1989); Preliminary version in Proc. 30th STOC 1989CrossRefMathSciNetGoogle Scholar
  12. 12.
    Lingas, A.: A geometric approach to Boolean matrix multiplication. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 501–510. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  13. 13.
    Mehlhorn, K.: Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry. EATCS Monographs on Theoretical Computer Science, Springer Verlag, Berlin (1984) Google Scholar
  14. 14.
    Schnorr, C.P., Subramanian, C.R.: Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses. In: Rolim, J.D.P., Serna, M., Luby, M. (eds.) RANDOM 1998. LNCS, vol. 1518, pp. 218–231. Springer, Heidelberg (1998)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Leszek Gąsieniec
    • 1
  • Andrzej Lingas
    • 2
  1. 1.Department of Computer ScienceUniversity of LiverpoolUK
  2. 2.Department of Computer ScienceLund UniversityLundSweden

Personalised recommendations