1. Broder, A.Z. (1986). How hard is it to marry at random? (on the approximation of the permanent), Proc. Eighteenth ACM Symposium on Theory of Computing, 50–58. Erratum in Proc. Twentieth ACM Symposium on Theory of Computing, 1988, p. 551.
2. Courant, R., K. Friedrichs, and H. Lewy (1928). Uber die Partiellen Differenzengleichungen der Matematischen Physik, Math. Annalen, 100, 32–74; translated into English by P. Fox (1956) NYO-7689, ABC Computing Facility, Institute of Mathematical Sciences, New York University.
3. Dyer, M., A. Frieze, and R. Kannan (1989). A random polynomial time algorithm for approximating the volume of convex bodies, Proc. Twenty-First ACM Symposium on Theory of Computing, 375–381; also in Research Report 88–40, Department of Mathematics, Carnegie-Mellon University, Pittsburgh, PA.
4. Feller, W. (1968). An Introduction to Probability Theory and Its Applications, vol. 1, third ed., John Wiley, New York.
5. Jerrum, M., and A. Sinclair (1988). Conductance and the rapid mixing property for Markov chains: The approximation of the permanent resolved, Proc. Twentieth ACM Symposium on Theory of Computing, 235–244.