Article

Free access

The linear-array conjecture in communication complexity is false

Authors:

Eyal Kushilevitz,

Nathan Linial,

Rafail OstrovskyAuthors Info & Claims

STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing

Pages 1 - 10

https://doi.org/10.1145/237814.237817

Published: 01 July 1996 Publication History

PDF eReader

References

[1]

A. Aho, J. Ullman, and M. Yannakakis, "On Notions of Information Transfer in VLSI Circuits", Proc. of 15th STOC, pp. 133-139, 1983.

Digital Library

Google Scholar

[2]

P. Duris, Z. Gall1, and G. Schnitger, "Lower Bounds on Communication Complexity'', Information and Computation, Vol. 73, No. 1, pp. 1-22, 1987. (Early version in Proc. of 16th STOC, pp. 81-91, 1984.)

Digital Library

Google Scholar

[3]

P. Frankl, and R. M. Wilson, "Intersection Theorems with Geometric Consequences", Combinatorica, Vol. 1, pp. 357- 368, 1981.

Crossref

Google Scholar

[4]

M. Karchmer, E. Kushilevitz, and N. Nisan, "Fractional Covers and Communication Complexity", SIAM J. Discrete Math., Vol. 8, No. 1, pp. 76-92, 1995. (Early version in 7th IEEE Structure in Complexity Theory, pp. 262-274, 1992.)

Digital Library

Google Scholar

[5]

R. J. Lipton, and R. Sedgewick, "Lower Bounds for VLSI", Proc. of 13th STOC, pp. 300-307. 1981.

Digital Library

Google Scholar

[6]

K. Mehlhorn, and E. Schmidt, "Las-Vegas is better than Determinism in VLSI and Distributed Computing", Proc. of ldth STOC, pp. 330-337, 1982.

Digital Library

Google Scholar

[7]

N. Nisan, and A. Wigderson, "Rounds in Communication Complexity Revisited", SIAM J. Computing, Vol. 22, No. 1, pp. 211-219, 1993. (Early version in Proc. of 23rd $TOC, pp. 419-429, 1991.)

Digital Library

Google Scholar

[8]

N. Nisan, and A. Wigderson, "On Rank vs. Communication Complexity", Combinatorica, Vol 15, No. 4, pp. 557-566, 1995. (Early version in Proc. of 35th FOCS, pp. 831-836, 1994.)

Crossref

Google Scholar

[9]

C. Papadimitriou, and M. Sipser, "Communication Complexity", JCSS, Vol. 28, No. 2, pp. 260-269, 1984. (Early version in Proc. of 14th STOC, pp. 196-200, 1982.)

Digital Library

Google Scholar

[10]

R. Raz, and B. Spieker, "On the "log rank" Conjecture in Communication Complexity", Combinatorica, Vol 15, No. 4, pp. 567-588, 1995. (Early version in Proc. of 34th FOCS, pp. 168-176, 1993.)

Crossref

Google Scholar

[11]

P. Tiwari, "Lower Bounds on Communication Complexity in Distributed Computer Networks", JACM, Vol. 34, No. 4, pp. 921-938, 1987. (Early version in Proc of 25th FOCS, pp. 109-117, 1984.)

Digital Library

Google Scholar

[12]

A. C. Yao, "Some Complexity Questions Related to Distributed Computing", Proc. of 11th STOC, pp. 209-213, 1979.

Digital Library

Google Scholar

Cited By

View all

Dinitz YMoran SRajsbaum SVitter JLarmore LLeighton T(1999)Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)Proceedings of the thirty-first annual ACM symposium on Theory of Computing10.1145/301250.301314(265-274)Online publication date: 1-May-1999
https://dl.acm.org/doi/10.1145/301250.301314
Dietzfelbinger MLeighton FShor P(1997)The linear-array problem in communication complexity resolvedProceedings of the twenty-ninth annual ACM symposium on Theory of computing10.1145/258533.258622(373-382)Online publication date: 4-May-1997
https://dl.acm.org/doi/10.1145/258533.258622
Kushilevitz E(1997)Communication Complexity10.1016/S0065-2458(08)60342-3(331-360)Online publication date: 1997
https://doi.org/10.1016/S0065-2458(08)60342-3

Index Terms

The linear-array conjecture in communication complexity is false
1. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes

Recommendations

Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks

We show that the conjectures by Matthews and Sumner (every 4-connected claw-free graph is Hamiltonian), by Thomassen (every 4-connected line graph is Hamiltonian) and by Fleischner (every cyclically 4-edge-connected cubic graph has either a 3-edge-...
Extremal hypergraphs for Ryser's Conjecture

Ryser's Conjecture states that any r-partite r-uniform hypergraph has a vertex cover of size at most r1 times the size of the largest matching. For r=2, the conjecture is simply Knig's Theorem and every bipartite graph is a witness for its tightness. ...
A planar linear arboricity conjecture
CIAC'10: Proceedings of the 7th international conference on Algorithms and Complexity

The linear arboricity la(G) of a graph G is the minimum number of linear forests (graphs where every connected component is a path) that partition the edges of G. In 1984, Akiyama et al. [1] stated the Linear Arboricity Conjecture (LAC), that the linear ...

Comments

Information & Contributors

Information

Published In

STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing

July 1996

661 pages

ISBN:0897917855

DOI:10.1145/237814

Chairman:
Gary L. Miller

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1996

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC96

Sponsor:

SIGACT

STOC96: ACM Symposium on Theory of Computing

May 22 - 24, 1996

Pennsylvania, Philadelphia, USA

Acceptance Rates

STOC '96 Paper Acceptance Rate 74 of 201 submissions, 37%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
359
Total Downloads

Downloads (Last 12 months)51
Downloads (Last 6 weeks)12

Reflects downloads up to 06 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Dinitz YMoran SRajsbaum SVitter JLarmore LLeighton T(1999)Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)Proceedings of the thirty-first annual ACM symposium on Theory of Computing10.1145/301250.301314(265-274)Online publication date: 1-May-1999
https://dl.acm.org/doi/10.1145/301250.301314
Dietzfelbinger MLeighton FShor P(1997)The linear-array problem in communication complexity resolvedProceedings of the twenty-ninth annual ACM symposium on Theory of computing10.1145/258533.258622(373-382)Online publication date: 4-May-1997
https://dl.acm.org/doi/10.1145/258533.258622
Kushilevitz E(1997)Communication Complexity10.1016/S0065-2458(08)60342-3(331-360)Online publication date: 1997
https://doi.org/10.1016/S0065-2458(08)60342-3

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks

Extremal hypergraphs for Ryser's Conjecture

A planar linear arboricity conjecture

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks

Extremal hypergraphs for Ryser's Conjecture

A planar linear arboricity conjecture

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations