2
$\begingroup$

What is the relation between number $0$-monochromatic rectangles in characteristic matrix and communication complexity?

What is the relation between number $1$-monochromatic rectangles in characteristic matrix and communication complexity?

Precisely how does this connect to logrank conjecture?

Is the number of $0$-monochromatic rectangles always almost same as $1$-monchromatic rectangles?

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.