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

by R Venkatesan, Leonid Levin
Venue:In Proc. of the 20th Ann. ACM Symp. on Theory of Computing