The SAT phase transition:

Abstract: "We describe a detailed experimental investigation of the phase transition for several different classes of randomly generated satisfiability problems. We observe a remarkable consistency of features in the phase transition despite the presence in some of the problem classes of clause...

Full description

Saved in:
Bibliographic Details
Main Authors: Gent, Ian P. (Author), Walsh, Toby (Author)
Format: Book
Language:English
Published: Edinburgh 1994
Series:University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 679
Subjects:
Summary:Abstract: "We describe a detailed experimental investigation of the phase transition for several different classes of randomly generated satisfiability problems. We observe a remarkable consistency of features in the phase transition despite the presence in some of the problem classes of clauses of mixed lengths. For instance, each of the problem classes considered has a sharp transition from satisfiable to unsatisfiable problems at a critical value. In addition, there is a common easy-hard- easy pattern in the difficulty of the problems, with the hardest problems being associated with the phase transition. However, the difficulty of problems of mixed clause lengths is much more variable than that of fixed clause length. Indeed, whilst the media difficulty of random problems of mixed clause lengths can be orders of magnitude easier than that of equivalently sized problems of fixed clause length, the hardest problems of mixed clause lengths can be orders of magnitude harder than the hardest equivalently sized problems of fixed clause length. Such very hard random problems may be of considerable practical and theoretical use in analysing algorithm performance."
Physical Description:14 S.

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection!