Q4612484 (Q4612484): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4086/toc.2018.v014a020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2405665546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An information statistics approach to data stream and communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Compress Interactive Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive Information Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public vs Private Coin in Bounded-Round Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Equals Amortized Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrepancy lower bound for information complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some intersection theorems for ordered sets and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with Noisy Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative Discrepancy Does Not Separate Information and Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential separation of communication and external information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Separation of Information and Communication for Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Communication Complexity of Correlation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Communication Complexity of Set Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive compression for product distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4601825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distributional complexity of disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Theory of Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressing Interactive Communication Under Product Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The communication complexity of addition / rank
 
Normal rank

Latest revision as of 00:42, 18 July 2024

scientific article; zbMATH DE number 7009619
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7009619

    Statements

    31 January 2019
    0 references
    communication complexity
    0 references
    information complexity
    0 references
    fooling distribution
    0 references
    separation of complexity measures
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references