1. A. L. Cauchy,”Memoire sur les fonctions qui ne peuvent obtenir que deux valeurs egales et de signs contraires par suite des transpositions operees entre les variables quelles renferment”, J. Ec. Polyt. 10 Cah. 17, 29–112, Oeuvres (2)i.
2. R. M. Karp,”Reducibility among combinatorial problems”, in R. E. Miller and J. W. Thatcher, (Eds.) Complexity of computer computations ( Plenum Press, New York, 1972 ), 85–103.
3. L. G. Valiant, “The complexity of computing the permanent”, Theor. Comput. Sci. 8, 189–201 (1978).
4. M. R. Garey and D. S. Johnson, Computers and Intractability, A guide to the Theory of NP-Completeness (W. H. Freeman and Company, New York, 1979 ).
5. H. Mine, Permanents, Encyclopedia of mathematics and its applications, v. 6, section on Linear algebra (Addison-Wesley, 1978 ).