Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems (1995)
by
Christoph Meinel
,
Stephan Waack
| Venue: | LATIN'95, LNCS 911 |
| Citations: | 2 - 0 self |
BibTeX
@INPROCEEDINGS{Meinel95lowerbounds,
author = {Christoph Meinel and Stephan Waack},
title = {Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems},
booktitle = {LATIN'95, LNCS 911},
year = {1995},
pages = {427--435},
publisher = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We investigate the modular communication complexity of the graph accessibility problem GAP and its modular counting versions MODk--GAP, k 2. Due to arguments concerning variation ranks and certain projection reductions, we prove that, for any partition of the input variables and for any moduls k and m, GAP and MODk--GAP have MODm--communication complexity\Omega (n), where n denotes the number of nodes of the graphs under consideration.
