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: 31 March 2020

Satisfiability

Satisfiability

Chapter:
(p.197) 10 Satisfiability
Source:
Information, Physics, and Computation
Author(s):

Marc Mézard

Andrea Montanari

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

Because of Cook's theorem, satisfiability lies at the heart of computational complexity theory. This chapter presents some selected research directions, focusing on ensembles of random satisfiability instances. When the density of constraints is increased, a phase transition between a SAT and an UNSAT phase take place. Properly tuned ensembles with a density close to the transition point provide a generator of particularly hard instances. The nature of this transition is discussed, and bounds on the critical density are obtained. On the algorithmic side, the discussion focuses on exhaustive search algorithms based on tree-search, and on random walk procedures.

Keywords:   satisfiability, SAT-UNSAT transition, phase transition, 2-SAT, K-SAT, threshold bound, Cook's theorem

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 .