Advertisement

Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound

  • Gillat Kol
  • Shay Moran
  • Amir Shpilka
  • Amir Yehudayoff
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8572)

Abstract

We consider two known lower bounds on randomized communication complexity: The smooth rectangle bound and the logarithm of the approximate nonnegative rank. Our main result is that they are the same up to a multiplicative constant and a small additive term.

The logarithm of the nonnegative rank is known to be a nearly tight lower bound on the deterministic communication complexity. Our result indicates that proving the analogue for the randomized case, namely that the log approximate nonnegative rank is a nearly tight bound on randomized communication complexity, would imply the tightness of the information cost bound.

Another corollary of our result is the existence of a boolean function with a quasipolynomial gap between its approximate rank and approximate nonnegative rank.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Alo03]
    Alon, N.: Problems and results in extremal combinatorics–i. Discrete Mathematics 273(1-3), 31–53 (2003)CrossRefMATHMathSciNetGoogle Scholar
  2. [Alo09]
    Alon, N.: Perturbed identity matrices have high rank: Proof and applications. Combinatorics, Probability & Computing 18(1-2), 3–15 (2009)CrossRefMATHGoogle Scholar
  3. [BL09]
    Beasley, L.B., Laffey, T.J.: Real rank versus nonnegative rank. Linear Algebra and its Applications 431(12), 2330–2335 (2009); Special Issue in honor of Shmuel FriedlandGoogle Scholar
  4. [BR11]
    Braverman, M., Rao, A.: Information equals amortized communication. In: FOCS, pp. 748–757 (2011)Google Scholar
  5. [Bra12]
    Braverman, M.: Interactive information complexity. In: STOC, pp. 505–524 (2012)Google Scholar
  6. [CSWY01]
    Chakrabarti, A., Shi, Y., Wirth, A., Yao, A.C.-C.: Informational complexity and the direct sum problem for simultaneous message complexity. In: FOCS, pp. 270–278 (2001)Google Scholar
  7. [GL13]
    Gavinsky, D., Lovett, S.: En route to the log-rank conjecture: New reductions and equivalent formulations. Electronic Colloquium on Computational Complexity (ECCC) 20, 80 (2013)Google Scholar
  8. [JK10]
    Jain, R., Klauck, H.: The partition bound for classical communication complexity and query complexity. In: IEEE Conference on Computational Complexity, pp. 247–258 (2010)Google Scholar
  9. [KLL+12]
    Kerenidis, I., Laplante, S., Lerays, V., Roland, J., Xiao, D.: Lower bounds on information complexity via zero-communication protocols and applications. In: FOCS, pp. 500–509 (2012)Google Scholar
  10. [KMSY14]
    Kol, G., Moran, S., Shpilka, A., Yehudayoff, A.: Approximate nonnegative rank is equivalent to the smooth rectangle boundy. Electronic Colloquium on Computational Complexity (ECCC) 21, 46 (2014)Google Scholar
  11. [KN97]
    Kushilevitz, E., Nisan, N.: Communication complexity. Cambridge University Press (1997)Google Scholar
  12. [Kra96]
    Krause, M.: Geometric arguments yield better bounds for threshold circuits and distributed computing. Theoretical Computer Science 156(1&2), 99–117 (1996)CrossRefMATHMathSciNetGoogle Scholar
  13. [Lee12]
    Troy Lee’s homepage. Some open problems around nonnegative rank (2012), http://www.research.rutgers.edu/~troyjlee/open_problems.pdf
  14. [LLR12]
    Laplante, S., Lerays, V., Roland, J.: Classical and quantum partition bound and detector inefficiency. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol. 7391, pp. 617–628. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  15. [Lov90]
    Lovász, L.: Communication complexity: A survey. In: Path, Flows, and VLSI-Networks, pp. 235–265 (1990)Google Scholar
  16. [Lov13]
    Lovett, S.: Communication is bounded by root of rank. CoRR, abs/1306.1877 (2013)Google Scholar
  17. [LS88]
    Lovász, L., Saks, M.E.: Lattices, möbius functions and communication complexity. In: FOCS, pp. 81–90 (1988)Google Scholar
  18. [LS07]
    Linial, N., Shraibman, A.: Lower bounds in communication complexity based on factorization norms. In: STOC, pp. 699–708 (2007)Google Scholar
  19. [LS09a]
    Lee, T., Shraibman, A.: An approximation algorithm for approximation rank. In: IEEE Conference on Computational Complexity, pp. 351–357 (2009)Google Scholar
  20. [LS09b]
    Lee, T., Shraibman, A.: Lower bounds in communication complexity. Foundations and Trends in Theoretical Computer Science 3(4), 263–398 (2009)CrossRefMathSciNetGoogle Scholar
  21. [MS82]
    Mehlhorn, K., Schmidt, E.M.: Las vegas is better than determinism in vlsi and distributed computing (extended abstract). In: STOC, pp. 330–337 (1982)Google Scholar
  22. [New91]
    Newman, I.: Private vs. common random bits in communication complexity. Information Processing Letters 39(2), 67–71 (1991)CrossRefMATHMathSciNetGoogle Scholar
  23. [NW95]
    Nisan, N., Wigderson, A.: On rank vs. communication complexity. Combinatorica 15(4), 557–565 (1995)CrossRefMATHMathSciNetGoogle Scholar
  24. [Raz02]
    Razborov, A.A.: Quantum communication complexity of symmetric predicates. Izvestiya of the Russian Academy of Science, Mathematics 67, 2003 (2002)Google Scholar
  25. [Yan91]
    Yannakakis, M.: Expressing combinatorial optimization problems by linear programs. Journal of Computer and System Sciences 43(3), 441–466 (1991)CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Gillat Kol
    • 1
  • Shay Moran
    • 2
  • Amir Shpilka
    • 3
  • Amir Yehudayoff
    • 4
  1. 1.School of MathematicsInstitute for Advanced StudyPrincetonUSA
  2. 2.Departments of Computer Science and MathematicsTechnionIsrael
  3. 3.Department of Computer ScienceTechnionHaifaIsrael
  4. 4.Department of MathematicsTechnionHaifaIsrael

Personalised recommendations