1. S. Arora and B. Barak, Computational Complexity: A Modern Approach, Cambridge University Press, 2009.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and hardness of approximation problems, J. ACM 45 (3), (1998), 501–555. Extended abstract in Proc. of the 33rd Annual Symposium on Foundations of Computer Science, IEEE Computer Society, 1992, 14–23.
3. S. Arora and S. Safra, Probabilistic checking proofs: a new characterization of $$NP$$ N P , J. ACM 45 (1), (1998), 70–122. Extended abstract in Proc. of the 33rd Annual Symposium on the Foundations of Computer Science, IEEE Computer Society, 1992, 2–13.
4. M. Baartse and K. Meer, Testing low degree trigonometric polynomials. Extended abstract in Proc. 9th International Computer Science Symposium in Russia CSR 2014, Moscow (N.K. Vereshchagin, E.A. Hirsch, S.O. Kuznetsov, and J.E. Pin, eds.), Springer LNCS, 2014.
5. M. Baartse and K. Meer, Topics in real and complex number complexity theory, in Recent Advances in Real Complexity and Computation (J.L. Montaña and L.M. Pardo, eds.), Contemporary Mathematics, vol. 604, American Mathematical Society (2013), 1–53.