A linear lower bound on the unbounded error probabilistic communication complexity. (Q1872728): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 05:01, 5 March 2024

scientific article
Language Label Description Also known as
English
A linear lower bound on the unbounded error probabilistic communication complexity.
scientific article

    Statements

    A linear lower bound on the unbounded error probabilistic communication complexity. (English)
    0 references
    0 references
    14 May 2003
    0 references
    probabilistic communication complexity
    0 references
    Hadamard matrix
    0 references
    spectral norm
    0 references
    lower bounds
    0 references

    Identifiers