IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i22p4651-d1280697.html
   My bibliography  Save this article

A Note on the LogRank Conjecture in Communication Complexity

Author

Listed:
  • Vince Grolmusz

    (Department of Computer Science, Eötvös Loránd University, H-1117 Budapest, Hungary)

Abstract

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 receive messages encoded with bits, then they can compute f ( x , y ) with exchanging ( log rank ( M f ) ) c bits, where M f is a Boolean matrix, determined by function f . The problem is widely open and very popular, and it has resisted numerous attacks in the last 35 years. The best upper bound is still exponential in the bound of the conjecture. Unfortunately, we cannot prove the conjecture, but we present a communication protocol with ( log rank ( M f ) ) c bits, which computes a (somewhat) related quantity to f ( x , y ) . The relation is characterized by the representation of low-degree, multi-linear polynomials modulo composite numbers. Our result may help to settle this long-open conjecture.

Suggested Citation

  • Vince Grolmusz, 2023. "A Note on the LogRank Conjecture in Communication Complexity," Mathematics, MDPI, vol. 11(22), pages 1-10, November.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:22:p:4651-:d:1280697
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/22/4651/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/22/4651/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:22:p:4651-:d:1280697. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.