1. Agrawal, M., Allender, E., Impagliazzo, R., Pitassi, T., Rudich, S.: Reducing the Complexity of Reductions. Computational Complexity 10, 117–138 (2001)
2. Glaßer, C., Herr, K., Reitwießner, C., Travers, S., Waldherr, M.: Equivalence Problems for Circuits over Sets of Natural Numbers. In: International Computer Science Symposium in Russia (CSR) (to appear, 2007)
3. Lecture Notes in Computer Science;P. McKenzie,2003
4. Papadimitriou, C.H.: Computational Complexity. Pearson (1994)
5. Stockmeyer, L.J., Meyer, A.R.: Word Problems Requiring Exponential Time. In: Proceedings 5th ACM Symposium on the Theory of Computation, pp. 1–9 (1973)