Editing Open Problems:31
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 1: | Line 1: | ||
− | {{ | + | {{DISPLAYTITLE:Problem 31: Gap-Hamming Information Cost}} |
− | | | + | {{Infobox |
− | | | + | |label1 = Proposed by |
+ | |data1 = Amit Chakrabarti | ||
+ | |label2 = Source | ||
+ | |data2 = [[Workshops:Kanpur_2009|Kanpur 2009]] | ||
+ | |label3 = Short link | ||
+ | |data3 = http://sublinear.info/31 | ||
}} | }} | ||
In the Gap-Hamming problem, two players Alice and Bob have vectors $x,y\in \{0,1\}^n$ respectively and wish to compute the function $f$ | In the Gap-Hamming problem, two players Alice and Bob have vectors $x,y\in \{0,1\}^n$ respectively and wish to compute the function $f$ | ||
Line 18: | Line 23: | ||
\] | \] | ||
It would be interesting to prove a lower bound on the information cost for the Gap-Hamming problem for some natural input distribution. | It would be interesting to prove a lower bound on the information cost for the Gap-Hamming problem for some natural input distribution. | ||
− | |||
− | |||
− |