1. Computing the volume is difficult;Bárányi;Proc. 18th Ann. ACM Symp. on Theory of Computing,1986
2. How hard is it to marry at random? (On the approximation of the permanent);Broder;Proc. 18th Ann. ACM Symp. on Theory of Computing,1986
3. Random walks, totally unimodular matrices and a randomised dual simplex algorithm;Dyer,1992
4. A randomised polynomial time algorithm for approximating the volume of convex bodies;Dyer;J. ACM,1991