Editing Open Problems:78
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 3: | Line 3: | ||
|who=Grigory Yaroslavtsev | |who=Grigory Yaroslavtsev | ||
}} | }} | ||
β | |||
β | Given $f$, we also define $f^+:\{0,1\}^n\times \{0,1\}^n \rightarrow\{0,1\}$ as $f^+ (x,y) = f(x\oplus y) | + | For a function $f:\{0,1\}^n\rightarrow\{0,1\}$, we define its deterministic linear sketch complexity $D^\text{lin}(f)$ as a the smallest number $k$ such that there exist $k$ sets $S_1,\ldots,S_k \subseteq [n]$ and for any $x\in \{0,1\}^n$ we can determine $f(x)$ using $\sum_{i\in S_1} x_i, \ldots, \sum_{i\in S_k} x_i$, where the sum is mod $2$. Randomized linear sketch complexity is denoted by $R^\text{lin}(f)$. |
+ | |||
+ | Given $f$, we also define $f^+:\{0,1\}^n\times \{0,1\}^n \rightarrow\{0,1\}$ as follows. For any $x,y\in\{0,1\}^n$, define $f^+ (x,y) = f(x\oplus y)$, where $\oplus$ denotes bitwise XOR. It is known that $D^\text{lin}(f) = D^\rightarrow(f^+)$ {{cite|Montanaro-O-09}}, where $D^\rightarrow$ denotes one-way communication complexity (Alice sends one message to Bob). | ||
Prove (or disprove) the following conjecture: $R^\text{lin}(f) = \tilde{\Theta}(R^\rightarrow(f^+))$. | Prove (or disprove) the following conjecture: $R^\text{lin}(f) = \tilde{\Theta}(R^\rightarrow(f^+))$. | ||
+ | |||
+ | <references /> |