Open Problems
Considering a 0/1 input matrix, the minimum number of bits exchanged to compute deterministically in the worst case, is known to be bounded from below by the logarithm of the rank of the matrix . The log rank conjecture proposes that the communication complexity, of is bounded from above by a constant power of the logarithm of the rank of . Since D(f) is bounded from above and below by polynomials of log rank, we can say D(f) is polynomially related to log rank. Since the rank of a matrix is polynomial time computable in the size of the matrix, such an upper bound would allow the matrix's communication complexity to be approximated in polynomial time. Note, however, that the size of the matrix itself is exponential in the size of the input.
For a randomized protocol, the number of bits exchanged in the worst case, R(f), is conjectured to be polynomially related to the following formula:
Such log rank conjectures are valuable because they reduce the question of a matrix's communication complexity to a question of linearly independent rows (columns) of the matrix. This reveals that the essence of the communication complexity problem, for example in the EQ case above, is figuring out where in the matrix the inputs are, in order to find out if they're equivalent.
Read more about this topic: Communication Complexity
Famous quotes containing the words open and/or problems:
“Is encouragement what the poet needs? Open question. Maybe he needs discouragement. In fact, quite a few of them need more discouragement, the most discouragement possible.”
—Robert Fitzgerald (1910–1985)
“I believe that if we are to survive as a planet, we must teach this next generation to handle their own conflicts assertively and nonviolently. If in their early years our children learn to listen to all sides of the story, use their heads and then their mouths, and come up with a plan and share, then, when they become our leaders, and some of them will, they will have the tools to handle global problems and conflict.”
—Barbara Coloroso (20th century)