Skip to main content

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
Cancel
×
×
Home
  • Home
P, NP, and NP-Completeness
  • Get access
    Buy the print book
    Check if you have access via personal or institutional login
    Log in Register Recommend to librarian
  • Cited by 9
  • Cited by
    Crossref Citations
    Crossref logo
    This (lowercase (translateProductType product.productType)) has been cited by the following publications. This list is generated based on data provided by CrossRef.
    MacCormick, John 2018. Strategies for Basing the CS Theory Course on Non-decision Problems. p. 521.
    Guedes, Elloá B. de Assis, Francisco Marcos and Medeiros, Rex A. C. 2016. Quantum Zero-Error Information Theory. p. 147.
    Sung, Chi Wan Shum, Kenneth W. Huang, Linyu and Kwan, Ho Yuet 2016. Linear Network Coding for Erasure Broadcast Channel With Feedback: Complexity and Algorithms. IEEE Transactions on Information Theory, Vol. 62, Issue. 5, p. 2493.
    Manasrah, Ahmad M. and Al-Din, Basim Najim 2016. Mapping private keys into one public key using binary matrices and masonic cipher: Caesar cipher as a case study. Security and Communication Networks, Vol. 9, Issue. 11, p. 1450.
    Sprintson, Alex 2014. Reductions techniques for establishing equivalence between different classes of network and index coding problems. p. 75.
    Yu, Quan Sung, Chi Wan and Chan, Terence H. 2014. Locally repairable codes over a network. p. 70.
    Grossi, Davide and Pigozzi, Gabriella 2014. Judgment Aggregation: A Primer. Synthesis Lectures on Artificial Intelligence and Machine Learning, Vol. 8, Issue. 2, p. 1.
    Johnson, T. H. Biamonte, J. D. Clark, S. R. and Jaksch, D. 2013. Solving search problems by strongly simulating quantum circuits. Scientific Reports, Vol. 3, Issue. 1,
    Goldreich, Oded 2011. Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation. Vol. 6650, Issue. , p. 507.
    ×
  • Export citation
  • Recommend to librarian
  • Recommend this book

    Email your librarian or administrator to recommend adding this book to your organisation's collection.

    P, NP, and NP-Completeness
    • Online ISBN: 9780511761355
    • Book DOI: https://doi.org/10.1017/CBO9780511761355
    Please enter your name
    Please enter a valid email address
    Who would you like to send this to *

    CAPTCHA *

    Skip to the audio challenge
    ×
  • Buy the print book
Information

Book description

The focus of this book is the P versus NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P versus NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs is harder than verifying their correctness. It is widely believed that the answer to these equivalent formulations is positive, and this is captured by saying that P is different from NP. Although the P versus NP Question remains unresolved, the theory of NP-completeness offers evidence for the intractability of specific problems in NP by showing that they are universal for the entire class. Amazingly enough, NP-complete problems exist, and furthermore hundreds of natural computational problems arising in many different areas of mathematics and science are NP-complete.

Reviews

'The author is a well-known expert in the field of complexity theory and so is well-qualified to bring out this book which will serve as a very good introductory textbook. The focus on search problems and promise problems in this book is to be appreciated since many books neglect these topics.'

S. V. Naaraj Source: SIGACT News

Refine List
Actions for selected content:
Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Send to Kindle
  • Send to Dropbox
  • Send to Google Drive
    • Send content to

    To send content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about sending content to .

    To send content items to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle.

    Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

    Find out more about the Kindle Personal Document Service.

    Please be advised that item(s) you selected are not available.
    You are about to send
    ×

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×
Contents

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 673 *
Loading metrics...

Book summary page views

Total views: 504 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 12th June 2018. This data will be updated every 24 hours.

Cancel
Confirm
×