1. Computational Complexity: A Modern approach;Arora,2009
2. V. Arvind, P.S. Joglekar, S. Srinivasan, Arithmetic circuits and the hadamard product of polynomials, in: FSTTCS, 2009, pp. 25–36.
3. V. Arvind, S. Srinivasan, On the hardness of the noncommutative determinant, in: STOC, 2010, pp. 677–686.
4. Quaternionic determinants;Aslaksen;Math. Int.,1996
5. Two algorithmic results for the traveling salesman problem;Barvinok;Math. Oper. Res.,1996