P, NP, and NP-completeness : the basics of computational complexity, Oded Goldreich
Resource Information
The instance P, NP, and NP-completeness : the basics of computational complexity, Oded Goldreich represents a material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.
The Resource
P, NP, and NP-completeness : the basics of computational complexity, Oded Goldreich
Resource Information
The instance P, NP, and NP-completeness : the basics of computational complexity, Oded Goldreich represents a material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.
- Label
- P, NP, and NP-completeness : the basics of computational complexity, Oded Goldreich
- Title remainder
- the basics of computational complexity
- Statement of responsibility
- Oded Goldreich
- Bibliography note
- Includes bibliographical references and index
- 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
- Dimensions
- 24 cm.
- Extent
- xxix, 184 p.
- Isbn
- 9780521192484
- Isbn Type
- (hardback)
- Lccn
- 2010023587
- Other physical details
- ill.
- Record ID
- 99194289880001161
- System control number
-
- (OCoLC)642204747
- (OCoLC)ocn642204747
Context
Context of P, NP, and NP-completeness : the basics of computational complexity, Oded GoldreichEmbed
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 fa-external-link-square fa-fw"></i> Data from <span resource="http://link.bu.edu/resource/vXYgq7YlmlA/" typeof="Book http://bibfra.me/vocab/lite/Instance"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/vXYgq7YlmlA/">P, NP, and NP-completeness : the basics of computational complexity, Oded Goldreich</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 Instance P, NP, and NP-completeness : the basics of computational complexity, Oded Goldreich
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.bu.edu/resource/vXYgq7YlmlA/" typeof="Book http://bibfra.me/vocab/lite/Instance"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/vXYgq7YlmlA/">P, NP, and NP-completeness : the basics of computational complexity, Oded Goldreich</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>
