Weak lumpability in the k-SAT problem

Applied Mathematics Letters

Volumn 13, Issue 6, 2000, Pages 49-53

  Grinfeld, M ^a   Knight, P A ^a  

^a UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

k SAT; Markov chains; Phase transition; Weak lumpability

Indexed keywords

EID: 0039838912     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0893-9659(00)00053-7     Document Type: Article

References (8)

1. B. Hayes, Can't get no satisfaction, American Scientist 85, 108-112, (1997).
2. A. Goerdt, A threshold for unsatisfiability, J. Comp. System Sci. 53, 469-486, (1996).
3. E. Friedgut, Necessary and sufficient conditions for sharp thresholds of graph properties, and the k-sat problem, Journal of the AMS 12, 1017-1054, (1999).
4. D. Aldous, Probability Approximations Via the Poisson Clumping Heuristic, Springer-Verlag, New York, (1989).
5. P. Diaconis, Applications of non-commutative Fourier analysis to probability problems, In Lecture Notes in Mathematics, Volume 1362, pp. 53-100, Springer-Verlag, Berlin, (1989).
6. P. Diaconis, The cutoff phenomena in finite Markov chains, Proc. Nat. Acad. Sci. 93, 1659-1664, (1996).
7. M. Grinfeld, P.A. Knight and A.O. Daalhuis, Spectral gap and cut-off in Markov chains, Technical Report, Department of Mathematics, University of Strathclyde, Glasgow. Submitted for publication in IMA Journal of Applied Mathematics, (1998).
8. H.G. Kemeny and J.L. Snell, Finite Markov Chains, Van Nostrand, Princeton, NJ, (1960).