Communication complexity towards lower bounds on circuit depth

Authors:
Jeff Edmonds;Russell Impagliazzo;Steven Rudich;Jiří Sgall
Affiliations:
-;-;-;-
Venue:
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Year:
1991

Citing 0
Cited 4

The history and status of the P versus NP question

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Direct product results and the GCD problem, in old and new communication models

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The Communication Complexity of the Universal Relation

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Choosing, Agreeing, and Eliminating in Communication Complexity

Computational Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

The computational complexity of approximating omega (G), the size of the largest clique in a graph G, within a given factor is considered. It is shown that if certain approximation procedures exist, then EXPTIME=NEXPTIME and NP=P.