Witnesses for Boolean Matrix Multiplication and for Shortest Paths

Abstract Summary of results The subcubic (O(n ) for < 3) algorithms to multiply Boolean matrices do not provide the witnesses; namely, they compute C = AB but if Cij = 1 they do not find an index k (a witness)

• Type: Conference
• Year: 1992
• Where: FOCS
• Authors: Noga Alon, Zvi Galil, Oded Margalit, Moni Naor
• Keywords: A Witness, Abstract Summary, Boolean Matrices, FOCS 1992, Theoretical Computer Science