Pages that link to "Item:Q1906853"

The following pages link to On the ``log rank''-conjecture in communication complexity (Q1906853):

Displaying 20 items.

• A counterexample to the Alon-Saks-Seymour conjecture and related problems (Q452825) (← links)
• Partition arguments in multiparty communication complexity (Q541668) (← links)
• Some order dimension bounds for communication complexity problems (Q921909) (← links)
• The linear-array conjecture in communication complexity is false (Q1125618) (← links)
• Communication complexity of two decision problems (Q1201105) (← links)
• Rank formulas for certain products of matrices (Q1311620) (← links)
• Algebraic techniques in communication complexity (Q1350289) (← links)
• The corruption bound, log-rank, and communication complexity (Q1621501) (← links)
• Chromatic number and the 2-rank of a graph (Q1850515) (← links)
• On rank vs. communication complexity (Q1906852) (← links)
• Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
• Testing properties of functions on finite groups (Q2830241) (← links)
• On set intersection representations of graphs (Q3633007) (← links)
• Deterministic Communication vs. Partition Number (Q4562279) (← links)
• Lower bounds for the majority communication complexity of various graph accessibility problems (Q4717056) (← links)
• Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices (Q5042455) (← links)
• The Log-Approximate-Rank Conjecture Is False (Q5133979) (← links)
• Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching (Q5741834) (← links)
• The communication complexity of enumeration, elimination, and selection (Q5956009) (← links)
• Around the log-rank conjecture (Q6050267) (← links)