Definitions from Wikipedia (Log-rank conjecture)

▸ noun:  In theoretical computer science, the log-rank conjecture states that the deterministic communication complexity of a two-party Boolean function is polynomially related to the logarithm of the rank of its input matrix.


▸ Words similar to log-rank conjecture
▸ Usage examples for log-rank conjecture

▸ Idioms related to log-rank conjecture
▸ Wikipedia articles (New!)
▸ Words that often appear near log-rank conjecture
▸ Rhymes of log-rank conjecture

▸ Invented words related to log-rank conjecture