Holdings Information

Bibliographic Record Display

• Title:P, NP, and NP-completeness : the basics of computational complexity / Oded Goldreich.
  
•    
• Author/Creator:Goldreich, Oded.
  
• Other Contributors/Collections:Cambridge Core EBA eBooks Complete Collection
  Cambridge Core All Books
  
• Published/Created:New York : Cambridge University Press, 2010.
  

• Holdings

  Holdings Record Display

  • Location:ONLINEWhere is this?
    
  • Call Number: QA267.7
    
  • Number of Items:
    0
  • Status:No information available 

   
• Library of Congress Subjects:Computational complexity.
  Computer algorithms.
  Approximation theory.
  Polynomials.
  
• Subject(s):Electronic books.
  
• Description:1 online resource
  
• Terms governing use:Access may be restricted to institutions with a site license.
  
• Summary:"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"--Provided by publisher.
  
• Notes:Includes bibliographical references and index.
  
• ISBN:9780521192484
  052119248X
  9780521122542
  0521122546
  
• Contents:Machine generated contents note: 1. Computational tasks and models; 2. The P versus NP Question; 3. Polynomial-time reductions; 4. NP-completeness; 5. Three relatively advanced topics; Epilogue: a brief overview of complexity theory.