ACM Symposium on Theory of Computing Bibliography ACM Symposium on Theory of Computing Bibliography Ramarathnam Venkatesan and Leonid A. Levin . Random instances of a graph coloring problem are hard. Selected papers that cite this one Jay Belanger and Jie Wang. No NP problems averaging over ranking of distributions are harder. Andreas Blass and Yuri Gurevich.
Matrix transformation is complete for the average case.
Ari Juels and Marcus Peinado. Hiding cliques for cryptographic security. Richard J. Lipton and Neal E. Young. Simple strategies for large zero-sum games with applications to complexity theory. Johann A. Makowsky and Abraham Sharell.