On the communication complexity of graph properties

Authors:
András Hajnal;Wolfgang Maass;György Turán
Affiliations:
Department of Mathematics, Statistics, and Computer Science, University of Illionis at Chicago and Mathematical Institute of the Hungarian Academy of Sciences, Budapest;Department of Mathematics, Statistics, and Computer Science, University of Illionis at Chicago and Mathematical Institute of the Hungarian Academy of Sciences, Budapest;Department of Mathematics, Statistics, and Computer Science, University of Illionis at Chicago and Automata Theory Research Group of the Hungarian Academy of Sciences, Szeged
Venue:
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Year:
1988

Citing 7
Cited 7

The VLSI Complexity of Selected Graph Problems

Journal of the ACM (JACM)
Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Lower bounds for VLSI

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
The entropic limitations on VLSI computations(Extended Abstract)

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Area-time complexity for VLSI

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The complexity of graph problems on vlsi

The complexity of graph problems on vlsi

The regularity lemma and its applications in graph theory

Theoretical aspects of computer science
Space Time Tradeoffs for Graph Properties

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The Regularity Lemma and Its Applications in Graph Theory

Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
On Multipartition Communication Complexity

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Probabilistic abstraction for model checking: An approach based on property testing

ACM Transactions on Computational Logic (TOCL)
Best-Order Streaming Model

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
The relationship between inner product and counting cycles

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove &thgr;(n log n) bounds for the deterministic 2-way communication complexity of the graph properties CONNECTIVITY, s-t-CONNECTIVITY and BIPARTITENESS (for arbitrary partitions of the variables into two sets of equal size). The proofs are based on combinatorial results of Dowling-Wilson and Lovász-Saks about partition matrices using the Möbius function, and the Regularity Lemma of Szemerédi. The bounds imply improved lower bounds for the VLSI complexity of these decision problems and sharp bounds for a generalized decision tree model which is related to the notion of evasiveness.