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:
“With liberty and pleasant weather, the simplest occupation, any unquestioned country mode of life which detains us in the open air, is alluring. The man who picks peas steadily for a living is more than respectable, he is even envied by his shop-worn neighbors. We are as happy as the birds when our Good Genius permits us to pursue any outdoor work, without a sense of dissipation.”
—Henry David Thoreau (1817–1862)
“...I have wanted to believe people could make their dreams come true ... that problems could be solved. However, this is a national illness. As Americans, we believe all problems can be solved, that all questions have answers.”
—Kristin Hunter (b. 1931)