Lower bounds in communication complexity based on factorization norms (Q5900542)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5485507
Language Label Description Also known as
default for all languages
No label defined
    English
    Lower bounds in communication complexity based on factorization norms
    scientific article; zbMATH DE number 5485507

      Statements

      Lower bounds in communication complexity based on factorization norms (English)
      0 references
      0 references
      0 references
      5 January 2009
      0 references
      lower bounds
      0 references
      randomized communication complexity
      0 references
      quantum communication complexity
      0 references
      factorization norms
      0 references
      entanglement
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references