1. A.V. Aho, J.E. Hopcroft and J.D. Ullman,The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974).
2. A.I. Barvinok, “Optimization problems on matroids and exponential sums,” in: E. Balas, G. Cornuéjols and R. Kannan, eds.,Integer Programming and Combinatorial Optimization, Proceedings of the Second IPCO Conference, Carnegie Mellon University (1992) pp. 316–333.
3. P.M. Camerini, G. Galbiati and F. Maffioli, “Random pseudo-polynomial algorithms for exact matroid problems,”Journal of Algorithms 13 (1992) 258–273.
4. A. Cayley, “On the theory of determinants,” in:Collected Papers, Vol. 1 (Cambridge University Press, Cambridge, 1889) pp. 63–80.
5. A. Cayley, “On the theory of linear transformations,” in:Collected Papers, Vol. 1 (Cambridge University Press, Cambridge, 1889) pp. 80–94.