1. Alekhnovich, M.: More on average case vs approximation complexity. In: Proceedings of 44th Symposium on Foundations of Computer Science (FOCS 2003), Cambridge, MA, USA, pp. 298–307. IEEE Computer Society, 11–14 October 2003
2. Alperin-Sheriff, J., Peikert, C.: Faster bootstrapping with polynomial error. In: Garay and Gennaro [GG14], pp. 297–314
3. Mix Barrington, D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in nc
$$^1$$
. J. Comput. Syst. Sci. 38(1), 150–164 (1989)
4. Lecture Notes in Computer Science;A Blum,1994
5. Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Goldwasser, S. (ed.) ITCS, pp. 309–325. ACM (2012). Invited to ACM Transactions onComputation Theory