1. Aldous, D.: Random walks on finite groups and rapidly mixing Markov chains. In: Séminaire de Probabilités XVII, pp. 243–297. Springer, Heidelberg (1983)
2. Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness of short symmetric instances of MAX-3SAT, Elec. Coll. on Comp. Compl., ECCC TR03-049 (2003)
3. Lecture Notes in Computer Science;M. Bordewich,2005
4. Bordewich, M., Dyer, M., Karpinski, M.: Metric construction, stopping times and path coupling (2005), http://arxiv.org/abs/math.PR/0511202
5. Bubley, R., Dyer, M.: Graph orientations with no sink and an approximation for a hard case of #SAT. In: Proc. 8th ACM-SIAM Symp. on Discrete Algorithms, pp. 248–257. SIAM, Philadelphia (1997)