Random instances of a graph coloring problem are hard (1988)

by Ramarathnam Venkatesan, Leonid Levin
Venue:In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC ’88