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, 2019. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 20 June 2019

Introduction to combinatorial optimization

Introduction to combinatorial optimization

Chapter:
(p.47) 3 Introduction to combinatorial optimization
Source:
Information, Physics, and Computation
Author(s):

Marc Mézard

Andrea Montanari

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

This chapter provides an elementary introduction to some basic concepts in theoretical computer science. It includes basic notions of graph theory and an informal introduction to computational complexity, presenting the basic classes P, NP, and NP-complete. These notions are illustrated by discussions of the minimal spanning tree and satisfiability problems, and by applications from statistical physics (spin glasses and maximum cuts), and from coding theory (decoding complexity).

Keywords:   computational complexity, NP-complete, graph theory, satisfiability, spin glasses, decoding complexity, minimal spanning tree

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 .