1. Alekhnovich, M., Ben-Sasson, E., Razborov, A., Wigderson, A.: Pseudorandom generators in propositional complexity. In: Proceedings of the 41st IEEE FOCS, pp. 43–53 (2000); Journal version to appear in SIAM Journal on Computing
2. Alekhnovich, M., Razborov, A.: Resolution is not automatizable unless W[P] is tractable. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pp. 210–219 (2001)
3. Alekhnovich, M., Razborov, A.: Lower bounds for the polynomial calculus: non-binomial case. Proceedings of the Steklov Institute of Mathematics 242, 18–35 (2003)
4. Arora, S.: The approximability of NP-hard problems. In: Proceedings of the 30th ACM Symposium on the Theory of Computing, pp. 337–348 (1998)
5. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and intractability of approximation problems. In: Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, pp. 13–22 (1992)