Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2017.55
URN: urn:nbn:de:0030-drops-79889
URL: https://drops.dagstuhl.de/opus/volltexte/2017/7988/
Korhonen, Janne H. ; Suomela, Jukka
Brief Announcement: Towards a Complexity Theory for the Congested Clique
| pdf-format: |
|
Abstract
The congested clique model of distributed computing has been receiving attention as a model for densely connected distributed systems. While there has been significant progress on the side of upper bounds, we have very little in terms of lower bounds for the congested clique; indeed, it is now know that proving explicit congested clique lower bounds is as difficult as proving circuit lower bounds. In this work, we use traditional complexity-theoretic tools to build a clearer picture of the complexity landscape of the congested clique, proving non-constructive lower bounds and studying the relationships between natural problems.
BibTeX - Entry
@InProceedings{korhonen_et_al:LIPIcs:2017:7988,
author = {Janne H. Korhonen and Jukka Suomela},
title = {{Brief Announcement: Towards a Complexity Theory for the Congested Clique}},
booktitle = {31st International Symposium on Distributed Computing (DISC 2017)},
pages = {55:1--55:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-053-8},
ISSN = {1868-8969},
year = {2017},
volume = {91},
editor = {Andr{\'e}a W. Richa},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7988},
URN = {urn:nbn:de:0030-drops-79889},
doi = {10.4230/LIPIcs.DISC.2017.55},
annote = {Keywords: distributed computing, congested clique, complexity theory}
}
| Keywords: | distributed computing, congested clique, complexity theory | |
| Seminar: | 31st International Symposium on Distributed Computing (DISC 2017) | |
| Issue date: | 2017 | |
| Date of publication: | 12.10.2017 |
