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...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematics (Basel) Vol. 11; no. 22; p. 4651
Main Author:	Grolmusz, Vince
Format:	Journal Article
Language:	English
Published:	Basel MDPI AG 01.11.2023
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!