Fractional covers and communication complexity

Mauricio Karchmer; Eyal Kushilevitz; Noam Nisan

Fractional covers and communication complexity

Mauricio Karchmer^*, Eyal Kushilevitz, Noam Nisan

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

11 Scopus citations

Abstract

It is possible to view communication complexity as the solution of an integer programming problem. The authors relax this integer programming problem to a linear programming problem, and try to deduce from it information regarding the original communication complexity question. This approach works well for nondeterministic communication complexity. In this case the authors get a special case of Lovasz's fractional cover measure and use it to completely characterize the amortized nondeterministic communication complexity. In the case of deterministic complexity the situation is more complicated. The authors discuss two attempts, and obtain some results using each of them.

Original language	English
Title of host publication	Proceedings of the Seventh Annual Structure in Complexity Theory Conference
Publisher	Publ by ERROR: no PUB record found for PX none CN nonpie IG 75516
Pages	262-274
Number of pages	13
ISBN (Print)	081862955X
State	Published - 1992
Externally published	Yes
Event	Proceedings of the Seventh Annual Structure in Complexity Theory Conference - Boston, MA, USA Duration: 22 Jun 1992 → 25 Jun 1992

Publication series

Name	Proceedings of the Seventh Annual Structure in Complexity Theory Conference

Conference

Conference	Proceedings of the Seventh Annual Structure in Complexity Theory Conference
City	Boston, MA, USA
Period	22/06/92 → 25/06/92

Cite this

@inproceedings{4e5bcb700da04bdc9e4d6620b5699878,

title = "Fractional covers and communication complexity",

abstract = "It is possible to view communication complexity as the solution of an integer programming problem. The authors relax this integer programming problem to a linear programming problem, and try to deduce from it information regarding the original communication complexity question. This approach works well for nondeterministic communication complexity. In this case the authors get a special case of Lovasz's fractional cover measure and use it to completely characterize the amortized nondeterministic communication complexity. In the case of deterministic complexity the situation is more complicated. The authors discuss two attempts, and obtain some results using each of them.",

author = "Mauricio Karchmer and Eyal Kushilevitz and Noam Nisan",

year = "1992",

language = "אנגלית",

isbn = "081862955X",

series = "Proceedings of the Seventh Annual Structure in Complexity Theory Conference",

publisher = "Publ by ERROR: no PUB record found for PX none CN nonpie IG 75516",

pages = "262--274",

booktitle = "Proceedings of the Seventh Annual Structure in Complexity Theory Conference",

note = "Proceedings of the Seventh Annual Structure in Complexity Theory Conference ; Conference date: 22-06-1992 Through 25-06-1992",

}

Karchmer, M, Kushilevitz, E & Nisan, N 1992, Fractional covers and communication complexity. in Proceedings of the Seventh Annual Structure in Complexity Theory Conference. Proceedings of the Seventh Annual Structure in Complexity Theory Conference, Publ by ERROR: no PUB record found for PX none CN nonpie IG 75516, pp. 262-274, Proceedings of the Seventh Annual Structure in Complexity Theory Conference, Boston, MA, USA, 22/06/92.

Fractional covers and communication complexity. / Karchmer, Mauricio; Kushilevitz, Eyal; Nisan, Noam.
Proceedings of the Seventh Annual Structure in Complexity Theory Conference. Publ by ERROR: no PUB record found for PX none CN nonpie IG 75516, 1992. p. 262-274 (Proceedings of the Seventh Annual Structure in Complexity Theory Conference).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Fractional covers and communication complexity

AU - Karchmer, Mauricio

AU - Kushilevitz, Eyal

AU - Nisan, Noam

PY - 1992

Y1 - 1992

N2 - It is possible to view communication complexity as the solution of an integer programming problem. The authors relax this integer programming problem to a linear programming problem, and try to deduce from it information regarding the original communication complexity question. This approach works well for nondeterministic communication complexity. In this case the authors get a special case of Lovasz's fractional cover measure and use it to completely characterize the amortized nondeterministic communication complexity. In the case of deterministic complexity the situation is more complicated. The authors discuss two attempts, and obtain some results using each of them.

AB - It is possible to view communication complexity as the solution of an integer programming problem. The authors relax this integer programming problem to a linear programming problem, and try to deduce from it information regarding the original communication complexity question. This approach works well for nondeterministic communication complexity. In this case the authors get a special case of Lovasz's fractional cover measure and use it to completely characterize the amortized nondeterministic communication complexity. In the case of deterministic complexity the situation is more complicated. The authors discuss two attempts, and obtain some results using each of them.

UR - http://www.scopus.com/inward/record.url?scp=0027089103&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0027089103

SN - 081862955X

T3 - Proceedings of the Seventh Annual Structure in Complexity Theory Conference

SP - 262

EP - 274

BT - Proceedings of the Seventh Annual Structure in Complexity Theory Conference

PB - Publ by ERROR: no PUB record found for PX none CN nonpie IG 75516

T2 - Proceedings of the Seventh Annual Structure in Complexity Theory Conference

Y2 - 22 June 1992 through 25 June 1992

ER -

Fractional covers and communication complexity

Abstract

Publication series

Conference

Other files and links

Fingerprint

Cite this