Interactive Information Complexity (Q3454520): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lower bounds for one-way probabilistic communication complexity and their application to space complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to compress interactive communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Privacy, additional information and communication / 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: Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: From information to exact communication / 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: Pseudorandom Generators for Regular Branching Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Product via Round-Preserving Compression / 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: Individual communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3573554 / 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: Q4023085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of average case communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Communication Complexity / 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: On the power of small-depth threshold circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct product theorem for two-party bounded-round public-coin communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A property of quantum relative entropy with an application to privacy in quantum communication / 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: Quantum one-way communication can be exponentially stronger than classical communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum and approximate privacy / 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: Interaction in quantum communication and the complexity of set disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjointness is hard in the multiparty number-on-the-forehead model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the randomized communication complexity of read-once functions / 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: Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching / 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: Q4601824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distributional complexity of disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards proving strong direct product theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Theory of Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Direct Product Theorems for Quantum Communication and Query Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiparty communication complexity of set disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Lower Bounds Using Directional Derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noiseless coding of correlated information sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Information Complexity / rank
 
Normal rank

Latest revision as of 02:47, 11 July 2024

scientific article
Language Label Description Also known as
English
Interactive Information Complexity
scientific article

    Statements

    Interactive Information Complexity (English)
    0 references
    0 references
    25 November 2015
    0 references
    information complexity
    0 references
    information theory
    0 references
    communication complexity
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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