P, NP, and NPcompleteness : the basics of computational complexity
Resource Information
The work P, NP, and NPcompleteness : the basics of computational complexity represents a distinct intellectual or artistic creation found in Boston University Libraries. This resource is a combination of several types including: Work, Language Material, Books.
The Resource
P, NP, and NPcompleteness : the basics of computational complexity
Resource Information
The work P, NP, and NPcompleteness : the basics of computational complexity represents a distinct intellectual or artistic creation found in Boston University Libraries. This resource is a combination of several types including: Work, Language Material, Books.
 Label
 P, NP, and NPcompleteness : the basics of computational complexity
 Title remainder
 the basics of computational complexity
 Statement of responsibility
 Oded Goldreich
 Subject

 Approximation theory
 Approximation theory
 Approximation theory
 Approximation theory
 Computational complexity
 Computational complexity
 Computational complexity
 Computational complexity
 Algorithmus  KomplexitÃ¤t
 Computer algorithms
 Computer algorithms
 Computer algorithms
 KomplexitÃ¤t  Algorithmus
 Polynomials
 Polynomials
 Polynomials
 Polynomials
 Computer algorithms
 Language
 eng
 Summary
 "The focus of this book is the PversusNP Question and the theory of NPcompleteness. It also provides adequate preliminaries regarding computational problems and computational models. The PversusNP 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 PversusNP Question remains unresolved, the theory of NPcompleteness offers evidence for the intractability of specific problems in NP by showing that they are universal for the entire class. Amazingly enough, NPcomplete problems exist, and furthermore hundreds of natural computational problems arising in many different areas of mathematics and science are NPcomplete"Provided by publisher
 Cataloging source
 DLC
 Illustrations
 illustrations
 Index
 index present
 LC call number
 QA267.7
 LC item number
 .G652 2010
 Literary form
 non fiction
 Nature of contents
 bibliography
Context
Context of P, NP, and NPcompleteness : the basics of computational complexityWork of
No resources found
No enriched resources found
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/resource/_QuA0PXlSl0/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/_QuA0PXlSl0/">P, NP, and NPcompleteness : the basics of computational complexity</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Work P, NP, and NPcompleteness : the basics of computational complexity
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/resource/_QuA0PXlSl0/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/_QuA0PXlSl0/">P, NP, and NPcompleteness : the basics of computational complexity</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>