Colorful Boolean Matrix Multiplication

Here, we are given an n×nn\times n Boolean matrix AA and an n×nn\times n Boolean matrix BB and a mapping color:[n]Γcolor : [n] \to \Gamma. For each i[n]i\in [n] and j[n]j\in [n], we want to decide whether {color(k):A[i,k]B[k,j],k[n]}=Γ\{color(k) : A[i, k] \wedge B[k, j], k \in [n]\} = \Gamma. In other words, for every pair of ii, jj, we want to determine whether the witnesses cover all the colors.

Parameters

  • nn: dimension of square matrix

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Displaying 3 of 3 reductions

Other relevant algorithms

Insuffient Data to display table