publication . Other literature type . Conference object . 1988

Lattices, mobius functions and communications complexity

L. Lovasz; M. Saks;
  • Published: 01 Jan 1988
  • Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Abstract
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. >
Subjects
ACM Computing Classification System: MathematicsofComputing_DISCRETEMATHEMATICS
free text keywords: Graph (abstract data type), Discrete mathematics, Descriptive complexity theory, PH, Communication complexity, Structural complexity theory, Lattice graph, Connectivity, Quantum complexity theory, Computer science, Combinatorics
Related Organizations
Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue
publication . Other literature type . Conference object . 1988

Lattices, mobius functions and communications complexity

L. Lovasz; M. Saks;