Top Tweets for #communicationcomplexity
#Minimizing #CommunicationComplexity #ZeroKnowledgeProofs #Python
I posted an article titled 'Minimizing Communication Complexity in Zero-Knowledge Proofs'.
https://t.co/vVxA1fPtRm
👐#call4reading
✍️Quantum #communicationcomplexity of #distribution testing #by Aleksandrs Belovs, Arturo Castellanos, Francois Le Gall, Guillaume Malod, and Alexander A. Sherstov
🔗10.26421/QIC21.15-16-1 (#arXiv:2006.14870)
社会における生成AIの役割 | Meer
#GenerativeAI #SemanticTransduction #CommunicationComplexity #GlobalizedSociety
https://t.co/nUwmvrRNNX
Check out the latest blog post on Newman's theorem via Carathéodory. Learn about a new proof in communication complexity using classical and approximate Carathéodory's theorems. Click here to read more: https://t.co/BQHHguzPAS #communicationcomplexity #newmanstheorem
Ο Avi Wigderson έλαβε το ACM A.M. TURING AWARD για το 2023 για GROUNDBREAKING INSIGHTS ON #RANDOMNESS
Σχετικό είναι το βιβλίο Communication Complexity, Hushilevitz E. And Nisan N., π.χ. Παπασωτηρίου (π.χ. σελίδ 27,25,26,40,35,35)
#communicationcomplexity
https://t.co/k945IstPmE
What are the up-to-date results on explicit lower bounds for $\Sigma_2$ communicati... https://t.co/YgJVHz07av #communicationcomplexity
>the exact cover number of the same function (for the definitions see [E. Kushilevitz, N. Nisan, #CommunicationComplexity, Cambridge University Press (1997)]). Then define $ CC(G) $ to be the maximum, taken over $ x,y$, of $ CC_{x,y}$, and define $\rho(G)$ to be the maximum,
>
![LGcommaI's tweet photo. >the exact cover number of the same function (for the definitions see [E. Kushilevitz, N. Nisan, #CommunicationComplexity, Cambridge University Press (1997)]). Then define $ CC(G) $ to be the maximum, taken over $ x,y$, of $ CC_{x,y}$, and define $\rho(G)$ to be the maximum,
> https://t.co/ePnUsNJ5rE](https://pbs.twimg.com/media/FgkTOroXEAEIprN.jpg)
#RazRepetitionTheorem-9
"For every $(x,y)\in X\times Y$, define $ Q_{x,y}\colon U\times V\longrightarrw\{0,1\}$, by $ Q_{x,y}(u,v)=Q(x, y,u,v)$. Define $ CC_{x,y}$ to be the deterministic #CommunicationComplexity of the function $ Q _{x,y}$, and define $\rho_{x,y}$ to be
>
>, by $ Q_{x,y}(u,v)=Q(x,y,u,v)$.
Define $ CC_{x,y}$ to be the deterministic #CommunicationComplexity of the function $ Q_{x,y}$, and define $\rho_{x,y}$ to be the exact cover number of the same function (for the definitions see [Kushilevitz―Nisan (1997)]).
Then
>
![LGcommaI's tweet photo. >, by $ Q_{x,y}(u,v)=Q(x,y,u,v)$.
Define $ CC_{x,y}$ to be the deterministic #CommunicationComplexity of the function $ Q_{x,y}$, and define $\rho_{x,y}$ to be the exact cover number of the same function (for the definitions see [Kushilevitz―Nisan (1997)]).
Then
> https://t.co/PQgs7dV6Fh](https://pbs.twimg.com/media/FgfHTm7WYAA1dab.jpg)
Can you answer this? Natural hard communication problems with both nondeterministic ... https://t.co/PT2ZNYD2ee #communicationcomplexity
Randomized communication complexity of or-of-equalities https://t.co/Lm3eb6Ysec #communicationcomplexity
3/3: Join & ask questions on simultaneous Live events on YouTube Live @hajiaghayi, Instagram @mhajiaghayi, LinkedIn @Mohammad Hajiaghayi, Twitter @MTHajiaghayi, and Facebook @Mohammad Hajiaghayi
#CommunicationComplexity #Coding #Hardness #Approximation #Randomness #PhDAdvising
2/3: We talk about life, research on Communication, Coding Theory, Hardness of Approximation Algorithms, Randomness, and Property Testing among other topics (in a simple language).
Can you answer this? Limitations of techniques in communication complexity https://t.co/8KiVcKfc3p #communicationcomplexity
Andrew Chi-Chih Yao - awarded 2021 #KyotoPrize in Information Science - was born in 1946 in Shanghai, China.
#minimaxtheorem #QuantumComputation #cryptography #communicationcomplexity
He received #KnuthPrize in 1996 and #TuringAward in 2000 as well.
https://t.co/xMxPBEOYWI
#HaitnerMazorOshmanReingoldYehudayoff-1
[#Cryptography
#Mathematics
#New
#Preprints]
"arXiv:2105.01958v2
On the #CommunicationComplexity of Key-Agreement Protocols
Iftach Haitner
Noam Mazor
Rotem Oshman
[all #TelAviv University/#Israel]
Omer Reingold
[#Stanford/California/#USA]>
#HaitnerMazorEtAlPrelimVersion-1
[#Complexity
#Cryptography
#HaitnerMazorOshmanReingoldYehudayoff]
"ITCS 2019, Article No. 40
On the #CommunicationComplexity of Key-Agreement Protocols
[Preliminary version of arXiv:2105.01958v2]
Iftach Haitner
(#TelAviv University, #Israel)
>
#HaitnerMazorOshmanReingoldYehudayoff-1
[#Cryptography
#Mathematics
#New
#Preprints]
"arXiv:2105.01958v1
On the #CommunicationComplexity of Key-Agreement Protocols
Iftach Haitner
Noam Mazor
Rotem Oshman
[all #TelAviv]
Omer Reingold
[#Stanford]
Amir Yehudayoff
[#Technion]"
>
![LGcommaI's tweet photo. #HaitnerMazorOshmanReingoldYehudayoff-1
[#Cryptography
#Mathematics
#New
#Preprints]
"arXiv:2105.01958v1
On the #CommunicationComplexity of Key-Agreement Protocols
Iftach Haitner
Noam Mazor
Rotem Oshman
[all #TelAviv]
Omer Reingold
[#Stanford]
Amir Yehudayoff
[#Technion]"
> https://t.co/H2wsvsorLm](https://pbs.twimg.com/media/E0zV65zXoAIdG_N.png)
![LGcommaI's tweet photo. #HaitnerMazorOshmanReingoldYehudayoff-1
[#Cryptography
#Mathematics
#New
#Preprints]
"arXiv:2105.01958v1
On the #CommunicationComplexity of Key-Agreement Protocols
Iftach Haitner
Noam Mazor
Rotem Oshman
[all #TelAviv]
Omer Reingold
[#Stanford]
Amir Yehudayoff
[#Technion]"
> https://t.co/H2wsvsorLm](https://pbs.twimg.com/media/E0zV44kXsAAChDN.png)
> honest parties' queries are uniformly random, or alternatively if the protocol uses non-adaptive queries and has only two rounds. Our proof for the first setting uses a novel reduction from the set-disjointness problem in two-party #CommunicationComplexity. For the second
>
Check out #DownloadForFree #TakagiLectures articles No. 1 - No.59 (2007-2020) here https://t.co/SIEc9mpqbm
e.g. No.51 is Mark Braverman
@Princeton
"Information complexity and applications"
#CommunicationComplexity #InformationComplexity
#mdpientropy Bell Inequalities with One Bit of Communication https://t.co/w7M0cbPc6b #quantumnonlocality; #communicationcomplexity
Last Seen Hashtags on Sotwe
Most Popular Users
Elon Musk 
@elonmusk
240.1M followers
Barack Obama
@barackobama
119.3M followers
Donald J. Trump
@realdonaldtrump
111.6M followers
Cristiano Ronaldo
@cristiano
109.1M followers
Narendra Modi
@narendramodi
106.9M followers
Rihanna
@rihanna
97.3M followers
NASA
@nasa
92.1M followers
Justin Bieber
@justinbieber
90.6M followers
KATY PERRY
@katyperry
86.9M followers
Taylor Swift
@taylorswift13
80.7M followers
Lady Gaga
@ladygaga
72.3M followers
Kim Kardashian
@kimkardashian
69.4M followers
Virat Kohli
@imvkohli
68.7M followers
YouTube
@youtube
68.6M followers
Bill Gates
@billgates
63.4M followers
The Ellen Show
@theellenshow
62.5M followers
CNN
@cnn
61.9M followers
Neymar Jr
@neymarjr
61.3M followers
X
@x
60.9M followers
Selena Gomez
@selenagomez
60M followers