Jump to ContentJump to Main Navigation
The Nature of Computation$
Users without a subscription are not able to see the full content.

Cristopher Moore and Stephan Mertens

Print publication date: 2011

Print ISBN-13: 9780199233212

Published to Oxford Scholarship Online: December 2013

DOI: 10.1093/acprof:oso/9780199233212.001.0001

Show Summary Details
Page of

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

Needles in a Haystack: the Class NP

Needles in a Haystack: the Class NP

Chapter:
(p.94) (p.95) Chapter 4 Needles in a Haystack: the Class NP
Source:
The Nature of Computation
Author(s):

Cristopher Moore

Stephan Mertens

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

NP refers to a class of decision problems in which yes-instances are easy to verify. That is: a decision problem is in NP if, whenever the answer for a particular instance is ‘yes’, there is a simple proof of this fact. Given a graph, a Hamiltonian path is a path that visits each vertex exactly once. This chapter examines the NP class of problems, first by considering the proverbial task of finding a needle in a haystack. It then looks at several definitions of NP and discusses proofs, witnesses, and lucky guesses. It shows that NP encompasses a wide range of fundamental problems, from coloring maps to untying knots and satisfying systems of constraints. It describes some of the classic problems in NP and highlights some reductions between these problems by transforming questions about graphs into questions about Boolean formulas or vice versa. The chapter also analyzes primality in NP.

Keywords:   decision problems, NP, Hamiltonian path, proofs, witnesses, lucky guesses, knots, graphs, Boolean formulas, primality

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 .