On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity (Q3012791): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-22006-7_5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1844039599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limitations of Quantum Advice and One-Way Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: The learnability of quantum states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense quantum coding and quantum finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Queries revisited. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential separation of quantum and classical one-way communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds on classical and quantum one-way communication complexity / 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: Quantum one-way communication can be exponentially stronger than classical communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Quantum Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds in communication complexity based on factorization norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Streams: Algorithms and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential separation of quantum and classical 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: Quantum communication complexity of symmetric predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth through breadth, or why should we attend talks in other areas? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3522503 / rank
 
Normal rank

Latest revision as of 06:49, 4 July 2024

scientific article
Language Label Description Also known as
English
On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity
scientific article

    Statements

    On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity (English)
    0 references
    0 references
    6 July 2011
    0 references
    0 references
    0 references