Lattices, mobius functions and communications complexity

A general framework for the study of a broad class of communication problems is developed. It is based on a recent analysis of the communication complexity of graph connectivity. The approach makes use of combinatorial lattice theory.<<ETX>>

[1]  Ronald L. Rivest,et al.  On Recognizing Graph Properties from Adjacency Matrices , 1976, Theor. Comput. Sci..

[2]  G. Rota.  On the foundations of combinatorial theory I. Theory of Möbius Functions , 1964 .

[3]  Alfred V. Aho,et al.  On notions of information transfer in VLSI circuits , 1983, STOC.

[4]  Wolfgang Maass,et al.  On the communication complexity of graph properties , 1988, STOC '88.

[5]  AbelsonHarold.  Lower Bounds on Information Transfer in Distributed Computations , 1980 .

[6]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[7]  Vojtech Rödl,et al.  Geometrical realization of set systems and probabilistic communication complexity , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[8]  Zvi Galil,et al.  Lower bounds on communication complexity , 1984, STOC '84.

[9]  Joseph Ja' Ja',et al.  The VLSI Complexity of Selected Graph Problems , 1984 .

[10]  Harold Abelson.  Lower Bounds on Information Transfer in Distributed Computations , 1978, FOCS.

[11]  Paul H. Edelman,et al.  The theory of convex geometries , 1985 .

[12]  A. J. Hoffman.  BINDING CONSTRAINTS AND HELLY NUMBERS , 1979 .

[13]  C. V. Nuffelen,et al.  A Bound for the Chromatic Number of a Graph , 1976 .

[14]  Mihalis Yannakakis,et al.  Expressing combinatorial optimization problems by linear programs , 1991, STOC '88.

[15]  Janos Simon,et al.  Probabilistic Communication Complexity , 1986, J. Comput. Syst. Sci..

[16]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[17]  Kurt Mehlhorn,et al.  Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) , 1982, STOC '82.

[18]  Thomas A. Dowling,et al.  Whitney Number Inequalities for Geometric Lattices , 1975 .

[19]  H. Crapo.  A higher invariant for matroids , 1967 .

[20]  Richard J. Lipton,et al.  Lower bounds for VLSI , 1981, STOC '81.

[21]  Peter Frankl,et al.  Complexity classes in communication complexity theory , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[22]  B. Lindström.  Determinants on semilattices , 1969 .

[23]  Viktor K. Prasanna,et al.  Information Transfer under Different Sets of Protocols , 1984, SIAM J. Comput..

[24]  Joseph JáJá.  The VLSI Complexity of Selected Graph Problems , 1984, JACM.

[25]  Susanne E. Hambrusch,et al.  Solving Undirected Graph Problems on VLSI , 1985, SIAM J. Comput..