A Note on the LogRank Conjecture in Communication Complexity

The LogRank conjecture of Lovász and Saks (1988) is the most famous open problem in communication complexity theory. The statement is as follows: suppose that two players intend to compute a Boolean function f(x,y) when x is known for the first and y for the second player, and they may send and rece...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Mathematics (Basel) Ročník 11; číslo 22; s. 4651
Hlavný autor:	Grolmusz, Vince
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Basel MDPI AG 01.11.2023
Predmet:	Analysis Boolean Boolean functions Chaos theory Communication communication complexity Complexity theory composite modulus Computer network protocols hyperdense coding logrank conjecture Polynomials Prediction (Logic) Protocol Upper bounds Hungary
ISSN:	2227-7390, 2227-7390
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!