1. Andreev A.E., Clementi A.E.F. and Rolim J.D.P. (1996), “Towards efficient constructions of hitting sets that derandomize BPP”, Research Report in ECCC, TR-96-029.
2. Allender E, Beals R, and Ogihara M. (1996), “The complexity of matrix rank and feasible systems of linear equations”, in Proc. of 28-th ACM STOC, to appear. Also available by ftp/www in ECCC (Tech. Rep. 1996).
3. Andreev, A.E. (1989), On the complexity of the realization of partial Boolean functions by circuits of functional elements, Diskret. mat. 1, pp.36–45. (In Russian). English translation in Discrete Mathematics and Applications 1, pp.251–262.
4. Andreev A.E., Clementi A.E.F. and Rolim J.D.P. (1996), “Hitting Sets derandomize BPP”, in Proc. of 23-th ICALP LNCS, Springer-Verlag, to appear. Also available by ftp/www in ECCC (Tech. Rep. 1996).
5. Andreev A.E., Clementi A.E.F. and Rolim J.D.P. (1996), “Optimal bounds for the approximation of boolean functions and some applications”, in Proc. of 13-th STACS, LNCS, Springer-Verlag (1996). Also available by ftp/www in ECCC (Tech. Rep. 1995).