A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852): 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.1007/s00453-015-0100-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2277697754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs / 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: A Parallel Repetition Theorem / 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 Equals Amortized Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interactive Information Odometer and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved direct product theorems for randomized query complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robustness of quantum Markov chains / 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: Strong Direct Product Theorems for Quantum Communication and Query Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4415257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On quantum and probabilistic communication / 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: Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strong direct product theorem for quantum query complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Products and Help Bits in Decision Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The communication complexity of pointer chasing / 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: Q3002796 / rank
 
Normal rank

Latest revision as of 23:55, 12 July 2024

scientific article
Language Label Description Also known as
English
A direct product theorem for two-party bounded-round public-coin communication complexity
scientific article

    Statements

    A direct product theorem for two-party bounded-round public-coin communication complexity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 November 2016
    0 references
    communication complexity
    0 references
    information theory
    0 references
    strong direct product theorem
    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
    0 references