1. Plausibly hard combinatorial tautologies;Avigad,1997
2. The relative complexity of NP search problems;Beame;Journal of Computer and System Sciences,1998
3. A. Beckmann, S. Buss, Polynomial local search in the polynomial hierarchy and witnessing in fragments of bounded arithmetic. Preprint, 2008.
4. J. Buresh-Oppenheim, T. Morioka, Relativized NP search problems and propositional proof systems, in: IEEE Conference on Computational Complexity, 2004, pp. 54–67.
5. S. Buss, Bounded Arithmetic, Bibliopolis, 1986.