Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Quantum distributed computing"'
Autor:
Magniez, Frédéric, Nayak, Ashwin
Publikováno v:
47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Jul 2020, Saarbrücken, Germany. pp.82:1--82:18, ⟨10.4230/LIPIcs.ICALP.2020.82⟩
47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Jul 2020, Saarbrücken, Germany. pp.82:1--82:18, ⟨10.4230/LIPIcs.ICALP.2020.82⟩
Set Disjointness on a Line is a variant of the Set Disjointness problem in a distributed computing scenario with $d+1$ processors arranged on a path of length $d$. It was introduced by Le Gall and Magniez (PODC 2018) for proving lower bounds on the q
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eddb5ca8968ce1f9e9470360a7958b69
https://doi.org/10.1145/3512751
https://doi.org/10.1145/3512751
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.