1. Ajtai, M.: Parity and the pigeonhole principle. In: Buss, S.R., Scott, P.J. (eds.) Feasible Mathematics, pp. 1–24. Basel: Birkhäuser 1990
2. Ajtai, M., Fagin, R.: Reachability is harder for directed than for undirected finite graphs. J. Symb. Logic55: 113–150 (1990)
3. Beame, P., Impagliazzo, R., Krajíček, J., Pitassi, T., Pudlák, P., Woods, A.: Exponential lower bounds for the pigeonhole principle. In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pp. 200–220. New York: Association for Computing Machinery 1992
4. Proceeding of the 27th ACM Symposium on Theory of Computing;P. Beame,1995
5. Buss, S.: The propositional pigeonhole principle has polynomial size Frege proofs. J. Symb. Logic52: 916–927 (1987)