Jump to ContentJump to Main Navigation
Information, Physics, and Computation$
Users without a subscription are not able to see the full content.

Marc Mézard and Andrea Montanari

Print publication date: 2009

Print ISBN-13: 9780198570837

Published to Oxford Scholarship Online: September 2009

DOI: 10.1093/acprof:oso/9780198570837.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2020. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 08 April 2020

Random K-satisfiability

Random K-satisfiability

Chapter:
(p.467) 20 Random K-satisfiability
Source:
Information, Physics, and Computation
Author(s):

Marc Mézard

Andrea Montanari

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780198570837.003.0020

This chapter studies an ensemble of random satisfiability problems, ‘random K-satisfiability’ (K-SAT). Applying the 1RSB cavity method, it first derives the phase diagram in the limit of large N, in particular the location of the SAT-UNSAT threshold. Within the SAT phase, the chapter focuses on the intermediate clustered phase close, and computes the number of clusters to leading exponential order in N. The application of survey propagation to this problem is then described. Combined with a simple decimation procedure, the chapter provides an efficient method for finding satisfiable assignments in the clustered phase. The whole chapter is based on heuristic arguments. There is not yet any rigorous proof of the results presented, neither concerning the phase diagram, nor the convergence properties of message passing algorithms and their use in decimation procedures.

Keywords:   satisfiability, K-SAT, random, phase transition, threshold, cluster, survey propagation, decimation

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .