The communication complexity of functions with large outputs (Q6148077): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The complexity of agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: The communication complexity of enumeration, elimination, and selection / 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: Internal Compression of Protocols to Entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosing, agreeing, and eliminating in communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive Information Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive compression to external information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Equals Amortized Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a reverse Newman's theorem in interactive information complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond set disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying equality with limited interaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Communication Complexity / 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 Information and Communication for Boolean Functions / 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: The Communication Complexity of Set Intersection and Multiple Equality Testing / 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: Interactive compression for product distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making Randomness Public in Unbounded-Round Information Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case interactive communication. I. Two messages are almost optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case interactive communication. II. Two messages are not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey on nonlocal games and operator space theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4612484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distributional complexity of disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressing Interactive Communication Under Product Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2913808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5414596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The communication complexity of addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5121897 / rank
 
Normal rank

Latest revision as of 17:05, 22 August 2024

scientific article; zbMATH DE number 7786530
Language Label Description Also known as
English
The communication complexity of functions with large outputs
scientific article; zbMATH DE number 7786530

    Statements

    The communication complexity of functions with large outputs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 January 2024
    0 references
    communication complexity
    0 references
    error reduction
    0 references
    non-Boolean functions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references