New bounds on classical and quantum one-way communication complexity (Q1029354): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / OpenAlex ID
 
Property / OpenAlex ID: W1483709803 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0802.4101 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The learnability of quantum states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learnability and the Vapnik-Chervonenkis dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fat-shattering and the learnability of real-valued functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5723506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Communication Complexity of Correlation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Quantum Memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bounded-Storage Model in the Presence of a Quantum Adversary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Private vs. common random bits in 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: On the density of families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864428 / rank
 
Normal rank

Latest revision as of 19:12, 1 July 2024

scientific article
Language Label Description Also known as
English
New bounds on classical and quantum one-way communication complexity
scientific article

    Statements

    New bounds on classical and quantum one-way communication complexity (English)
    0 references
    0 references
    0 references
    10 July 2009
    0 references
    0 references
    communication complexity
    0 references
    information theory
    0 references
    quantum
    0 references
    rectangle bound
    0 references
    0 references
    0 references