Graph entropy and quantum sorting problems
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Communication lower bounds via the chromatic number
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Hi-index | 0.00 |
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.