Q4568116 (Q4568116): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.v014a006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2556555060 / 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: Information lower bounds via self-reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Equals Amortized Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Product via Round-Preserving Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information complexity is computable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information complexity of the AND function in the two-party and multi-party settings / 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: New Strong Direct Product Results in Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449184 / 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: A strong direct product theorem for disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Results on Distributed Source Coding for Interactive Function Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Infinite-Message Limit of Two-Terminal Interactive Source Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching / 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: Communication Complexity Theory: Thirty-Five Years of Set Disjointness / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:11, 15 July 2024

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

    Statements

    0 references
    0 references
    0 references
    0 references
    15 June 2018
    0 references
    communication complexity
    0 references
    information complexity
    0 references

    Identifiers