文章基本信息

标题：Brief Announcement: Towards a Complexity Theory for the Congested Clique
本地全文：下载
作者：Janne H. Korhonen ; Jukka Suomela
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2017
卷号：91
页码：55:1-55:3
DOI：10.4230/LIPIcs.DISC.2017.55
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：distributed computing; congested clique; complexity theory