Pages that link to "Item:Q5167769"

The following pages link to En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations (Q5167769):

Displaying 12 items.

• The log-rank conjecture and low degree polynomials (Q1029056) (← links)
• The landscape of communication complexity classes (Q1653337) (← links)
• Upper bounds on communication in terms of approximate rank (Q2117081) (← links)
• On public-coin zero-error randomized communication complexity (Q2169433) (← links)
• Approximate nonnegative rank is equivalent to the smooth rectangle bound (Q2422764) (← links)
• Relative Discrepancy Does not Separate Information and Communication Complexity (Q3448811) (← links)
• Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications (Q3449568) (← links)
• The Log-Approximate-Rank Conjecture Is False (Q5133979) (← links)
• Rectangles are nonnegative juntas (Q5890971) (← links)
• Around the log-rank conjecture (Q6050267) (← links)
• (Q6062152) (← links)
• Upper bounds on communication in terms of approximate rank (Q6635689) (← links)