Bounds on oblivious multiparty quantum communication complexity (Q6164004): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4312298511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002757 / 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: Q4542521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods in the congested clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4939137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The communication complexity of distributed task allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms. The state of the art / 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: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4637980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5075823 / 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: Quantum communication complexity of symmetric predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5090444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pattern Matrix Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-party Quantum Communication Complexity with Routed Messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Information Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3636247 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:28, 2 August 2024

scientific article; zbMATH DE number 7719372
Language Label Description Also known as
English
Bounds on oblivious multiparty quantum communication complexity
scientific article; zbMATH DE number 7719372

    Statements

    Bounds on oblivious multiparty quantum communication complexity (English)
    0 references
    0 references
    0 references
    26 July 2023
    0 references
    quantum complexity theory
    0 references
    quantum communication complexity
    0 references
    multiparty communication
    0 references

    Identifiers

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