1. Agrawal, M., Allender, E., Impagliazzo, R., Pitassi, T., Rudich, S.: Reducing the complexity of reductions. Computational Complexity 10(2), 117–138 (2001)
2. Allender, E., Koucký, M.: Amplifying lower bounds by means of self-reducibility. J. of the ACM, 57(3) (2010)
3. Lecture Notes in Computer Science;S Arora,2009
4. Batcher, K.E.: Sorting networks and their applications. AFIPS Spring Joint Computing Conference 32, 307–314 (1968)
5. Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E.: On the concrete-efficiency threshold of probabilistically-checkable proofs. Electronic Colloquium on Computational Complexity (ECCC) 19, 45 (2012)