1. Laszlo Babai, Ludik Kucera, Canonical labelling of graphs in linear average time, in: Proceedings of the 20th Annual Symposium on Foundations of Computer Science (FOCS 1979), 1979, pp. 39–46.
2. Average-case complexity;Bogdanov;Foundation and Trends in Theoretical Computer Science,2006
3. Yijia Chen, Joerg Flum, Moritz Muller, Hard instances of algorithms and proof systems, Technical Report 11-085, ECCC, 2011.
4. Consequences of the provability of NP⊆P/poly;Cook;The Journal of Symbolic Logic,2007
5. Edward A. Hirsch, Dmitry Itsykson, Ivan Monakhov, Alexander Smal, On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography, Theory of Computing Systems, in press, doi:10.1007/s00224-011-9354-3. Extended abstract appeared in the Proceedings of STACS-2010. Preliminary version is available as ECCC TR10-193.