Internformat: P, NP, and NP-completeness :

P, NP, and NP-completeness :: the basics of computational complexity /

"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 sol...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Goldreich, Oded
Format:	Elektronisch E-Book
Sprache:	English
Veröffentlicht:	Cambridge ; New York : Cambridge University Press, ©2010.
Schlagworte:	Computational complexity. Computer algorithms. Approximation theory. Polynomials. Algorithms Complexité de calcul (Informatique) Algorithmes. Théorie de l'approximation. Polynômes. algorithms. COMPUTERS > Programming > Open Source. COMPUTERS > Software Development & Engineering > Tools. COMPUTERS > Software Development & Engineering > General. Approximation theory Computational complexity Computer algorithms Polynomials Electronic books.
Online-Zugang:	Volltext
Zusammenfassung:	"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"--
Beschreibung:	1 online resource (xxix, 184 pages) : illustrations
Bibliographie:	Includes bibliographical references (pages 181-182) and index.
ISBN:	9780511909443 0511909446 9780511906657 051190665X 1282797662 9781282797666 9780511761355 051176135X 1139929771 9781139929776 9786612797668 6612797665 0511908687 9780511908682 0511905378 9780511905377 0511907931 9780511907937

Internformat

MARC


LEADER	00000cam a2200000 a 4500
001	ZDB-4-EBA-ocn672333517
003	OCoLC
005	20241004212047.0
006	m o d
007	cr mnu---unuuu
008	101028s2010 enka ob 001 0 eng d
010			\|z 2010023587
040			\|a N$T \|b eng \|e pn \|c N$T \|d YDXCP \|d OSU \|d CDX \|d E7B \|d OCLCQ \|d REDDC \|d OCLCQ \|d DEBSZ \|d OCLCQ \|d CAMBR \|d OCLCF \|d OCLCQ \|d COD \|d OCLCQ \|d IDEBK \|d PIFAR \|d VGM \|d OCLCQ \|d WY@ \|d LUE \|d UAB \|d OCLCQ \|d TKN \|d OCLCQ \|d K6U \|d LUN \|d CUY \|d UKAHL \|d QGK \|d OCLCO \|d OCLCQ \|d INARC \|d OCLCO \|d OCLCQ \|d OCLCL \|d SFB \|d OCLCQ
019			\|a 671531020 \|a 729025938 \|a 816592434 \|a 817916197 \|a 819629682 \|a 1170826001 \|a 1171013872 \|a 1259216847 \|a 1392328185
020			\|a 9780511909443 \|q (electronic bk.)
020			\|a 0511909446 \|q (electronic bk.)
020			\|a 9780511906657 \|q (ebook)
020			\|a 051190665X \|q (ebook)
020			\|a 1282797662
020			\|a 9781282797666
020			\|z 9780521192484 \|q (hardback)
020			\|z 052119248X \|q (hardback)
020			\|z 9780521122542 \|q (pbk.)
020			\|z 0521122546 \|q (pbk.)
020			\|a 9780511761355 \|q (ebook)
020			\|a 051176135X
020			\|a 1139929771
020			\|a 9781139929776
020			\|a 9786612797668
020			\|a 6612797665
020			\|a 0511908687
020			\|a 9780511908682
020			\|a 0511905378
020			\|a 9780511905377
020			\|a 0511907931
020			\|a 9780511907937
024	8		\|a 9786612797668
035			\|a (OCoLC)672333517 \|z (OCoLC)671531020 \|z (OCoLC)729025938 \|z (OCoLC)816592434 \|z (OCoLC)817916197 \|z (OCoLC)819629682 \|z (OCoLC)1170826001 \|z (OCoLC)1171013872 \|z (OCoLC)1259216847 \|z (OCoLC)1392328185
037			\|a 279766 \|b MIL
050		4	\|a QA267.7 \|b .G652 2010eb
072		7	\|a COM \|x 051390 \|2 bisacsh
072		7	\|a COM \|x 051440 \|2 bisacsh
072		7	\|a COM \|x 051230 \|2 bisacsh
072		7	\|a UMB \|2 bicssc
082	7		\|a 005.1 \|2 22
049			\|a MAIN
100	1		\|a Goldreich, Oded. \|0 http://id.loc.gov/authorities/names/n98097979
245	1	0	\|a P, NP, and NP-completeness : \|b the basics of computational complexity / \|c Oded Goldreich.
260			\|a Cambridge ; \|a New York : \|b Cambridge University Press, \|c ©2010.
300			\|a 1 online resource (xxix, 184 pages) : \|b illustrations
336			\|a text \|b txt \|2 rdacontent
337			\|a computer \|b c \|2 rdamedia
338			\|a online resource \|b cr \|2 rdacarrier
520			\|a "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"-- \|c Provided by publisher.
504			\|a Includes bibliographical references (pages 181-182) and index.
505	0		\|a Computational tasks and models -- The P versus NP question -- Polynomial-time reductions -- NP-completeness -- Three relatively advanced topics -- Epilogue: a brief overview of complexity theory.
588	0		\|a Print version record.
546			\|a English.
650		0	\|a Computational complexity. \|0 http://id.loc.gov/authorities/subjects/sh85029473
650		0	\|a Computer algorithms. \|0 http://id.loc.gov/authorities/subjects/sh91000149
650		0	\|a Approximation theory. \|0 http://id.loc.gov/authorities/subjects/sh85006190
650		0	\|a Polynomials. \|0 http://id.loc.gov/authorities/subjects/sh85104702
650		2	\|a Algorithms \|0 https://id.nlm.nih.gov/mesh/D000465
650		6	\|a Complexité de calcul (Informatique)
650		6	\|a Algorithmes.
650		6	\|a Théorie de l'approximation.
650		6	\|a Polynômes.
650		7	\|a algorithms. \|2 aat
650		7	\|a COMPUTERS \|x Programming \|x Open Source. \|2 bisacsh
650		7	\|a COMPUTERS \|x Software Development & Engineering \|x Tools. \|2 bisacsh
650		7	\|a COMPUTERS \|x Software Development & Engineering \|x General. \|2 bisacsh
650		7	\|a Approximation theory \|2 fast
650		7	\|a Computational complexity \|2 fast
650		7	\|a Computer algorithms \|2 fast
650		7	\|a Polynomials \|2 fast
655		0	\|a Electronic books.
655		4	\|a Electronic books.
776	0	8	\|i Print version: \|a Goldreich, Oded. \|t P, NP, and NP-completeness. \|d New York : Cambridge University Press, 2010 \|z 9780521192484 \|w (DLC) 2010023587 \|w (OCoLC)642204747
856	4	0	\|l FWS01 \|p ZDB-4-EBA \|q FWS_PDA_EBA \|u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=335200 \|3 Volltext
938			\|a Coutts Information Services \|b COUT \|n 15552555
938			\|a ebrary \|b EBRY \|n ebr10421563
938			\|a EBSCOhost \|b EBSC \|n 335200
938			\|a ProQuest MyiLibrary Digital eBook Collection \|b IDEB \|n 279766
938			\|a YBP Library Services \|b YANK \|n 3525102
938			\|a YBP Library Services \|b YANK \|n 3478332
938			\|a YBP Library Services \|b YANK \|n 3500655
938			\|a YBP Library Services \|b YANK \|n 9246371
938			\|a Askews and Holts Library Services \|b ASKH \|n AH22947183
938			\|a Internet Archive \|b INAR \|n pnpnpcompletenes0000gold
994			\|a 92 \|b GEBAY
912			\|a ZDB-4-EBA
049			\|a DE-863

Datensatz im Suchindex

DE-BY-FWS_katkey	ZDB-4-EBA-ocn672333517
_version_	1816881743899131905
adam_text
any_adam_object
author	Goldreich, Oded
author_GND	http://id.loc.gov/authorities/names/n98097979
author_facet	Goldreich, Oded
author_role
author_sort	Goldreich, Oded
author_variant	o g og
building	Verbundindex
bvnumber	localFWS
callnumber-first	Q - Science
callnumber-label	QA267
callnumber-raw	QA267.7 .G652 2010eb
callnumber-search	QA267.7 .G652 2010eb
callnumber-sort	QA 3267.7 G652 42010EB
callnumber-subject	QA - Mathematics
collection	ZDB-4-EBA
contents	Computational tasks and models -- The P versus NP question -- Polynomial-time reductions -- NP-completeness -- Three relatively advanced topics -- Epilogue: a brief overview of complexity theory.
ctrlnum	(OCoLC)672333517
dewey-full	005.1
dewey-hundreds	000 - Computer science, information, general works
dewey-ones	005 - Computer programming, programs, data, security
dewey-raw	005.1
dewey-search	005.1
dewey-sort	15.1
dewey-tens	000 - Computer science, information, general works
discipline	Informatik
format	Electronic eBook
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05546cam a2201045 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn672333517</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr mnu---unuuu</controlfield><controlfield tag="008">101028s2010 enka ob 001 0 eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="z"> 2010023587</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OSU</subfield><subfield code="d">CDX</subfield><subfield code="d">E7B</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">REDDC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">CAMBR</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">COD</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">IDEBK</subfield><subfield code="d">PIFAR</subfield><subfield code="d">VGM</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">WY@</subfield><subfield code="d">LUE</subfield><subfield code="d">UAB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">TKN</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">K6U</subfield><subfield code="d">LUN</subfield><subfield code="d">CUY</subfield><subfield code="d">UKAHL</subfield><subfield code="d">QGK</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">INARC</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCL</subfield><subfield code="d">SFB</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">671531020</subfield><subfield code="a">729025938</subfield><subfield code="a">816592434</subfield><subfield code="a">817916197</subfield><subfield code="a">819629682</subfield><subfield code="a">1170826001</subfield><subfield code="a">1171013872</subfield><subfield code="a">1259216847</subfield><subfield code="a">1392328185</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511909443</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511909446</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511906657</subfield><subfield code="q">(ebook)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">051190665X</subfield><subfield code="q">(ebook)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1282797662</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781282797666</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780521192484</subfield><subfield code="q">(hardback)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">052119248X</subfield><subfield code="q">(hardback)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780521122542</subfield><subfield code="q">(pbk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0521122546</subfield><subfield code="q">(pbk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511761355</subfield><subfield code="q">(ebook)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">051176135X</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139929771</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139929776</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9786612797668</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">6612797665</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511908687</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511908682</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511905378</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511905377</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511907931</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511907937</subfield></datafield><datafield tag="024" ind1="8" ind2=" "><subfield code="a">9786612797668</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)672333517</subfield><subfield code="z">(OCoLC)671531020</subfield><subfield code="z">(OCoLC)729025938</subfield><subfield code="z">(OCoLC)816592434</subfield><subfield code="z">(OCoLC)817916197</subfield><subfield code="z">(OCoLC)819629682</subfield><subfield code="z">(OCoLC)1170826001</subfield><subfield code="z">(OCoLC)1171013872</subfield><subfield code="z">(OCoLC)1259216847</subfield><subfield code="z">(OCoLC)1392328185</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">279766</subfield><subfield code="b">MIL</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA267.7</subfield><subfield code="b">.G652 2010eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">051390</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">051440</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">051230</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">UMB</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">22</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Goldreich, Oded.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n98097979</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">P, NP, and NP-completeness :</subfield><subfield code="b">the basics of computational complexity /</subfield><subfield code="c">Oded Goldreich.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Cambridge ;</subfield><subfield code="a">New York :</subfield><subfield code="b">Cambridge University Press,</subfield><subfield code="c">©2010.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xxix, 184 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">"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"--</subfield><subfield code="c">Provided by publisher.</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (pages 181-182) and index.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Computational tasks and models -- The P versus NP question -- Polynomial-time reductions -- NP-completeness -- Three relatively advanced topics -- Epilogue: a brief overview of complexity theory.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computational complexity.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85029473</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer algorithms.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh91000149</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Approximation theory.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85006190</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Polynomials.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85104702</subfield></datafield><datafield tag="650" ind1=" " ind2="2"><subfield code="a">Algorithms</subfield><subfield code="0">https://id.nlm.nih.gov/mesh/D000465</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Algorithmes.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Théorie de l'approximation.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Polynômes.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithms.</subfield><subfield code="2">aat</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Programming</subfield><subfield code="x">Open Source.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Software Development & Engineering</subfield><subfield code="x">Tools.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Software Development & Engineering</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Approximation theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computational complexity</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Polynomials</subfield><subfield code="2">fast</subfield></datafield><datafield tag="655" ind1=" " ind2="0"><subfield code="a">Electronic books.</subfield></datafield><datafield tag="655" ind1=" " ind2="4"><subfield code="a">Electronic books.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Goldreich, Oded.</subfield><subfield code="t">P, NP, and NP-completeness.</subfield><subfield code="d">New York : Cambridge University Press, 2010</subfield><subfield code="z">9780521192484</subfield><subfield code="w">(DLC) 2010023587</subfield><subfield code="w">(OCoLC)642204747</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=335200</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Coutts Information Services</subfield><subfield code="b">COUT</subfield><subfield code="n">15552555</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10421563</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">335200</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">279766</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">3525102</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">3478332</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">3500655</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">9246371</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH22947183</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Internet Archive</subfield><subfield code="b">INAR</subfield><subfield code="n">pnpnpcompletenes0000gold</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection>
genre	Electronic books.
genre_facet	Electronic books.
id	ZDB-4-EBA-ocn672333517
illustrated	Illustrated
indexdate	2024-11-27T13:17:35Z
institution	BVB
isbn	9780511909443 0511909446 9780511906657 051190665X 1282797662 9781282797666 9780511761355 051176135X 1139929771 9781139929776 9786612797668 6612797665 0511908687 9780511908682 0511905378 9780511905377 0511907931 9780511907937
language	English
oclc_num	672333517
open_access_boolean
owner	MAIN DE-863 DE-BY-FWS
owner_facet	MAIN DE-863 DE-BY-FWS
physical	1 online resource (xxix, 184 pages) : illustrations
psigel	ZDB-4-EBA
publishDate	2010
publishDateSearch	2010
publishDateSort	2010
publisher	Cambridge University Press,
record_format	marc
spelling	Goldreich, Oded. http://id.loc.gov/authorities/names/n98097979 P, NP, and NP-completeness : the basics of computational complexity / Oded Goldreich. Cambridge ; New York : Cambridge University Press, ©2010. 1 online resource (xxix, 184 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier "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. Includes bibliographical references (pages 181-182) and index. Computational tasks and models -- The P versus NP question -- Polynomial-time reductions -- NP-completeness -- Three relatively advanced topics -- Epilogue: a brief overview of complexity theory. Print version record. English. Computational complexity. http://id.loc.gov/authorities/subjects/sh85029473 Computer algorithms. http://id.loc.gov/authorities/subjects/sh91000149 Approximation theory. http://id.loc.gov/authorities/subjects/sh85006190 Polynomials. http://id.loc.gov/authorities/subjects/sh85104702 Algorithms https://id.nlm.nih.gov/mesh/D000465 Complexité de calcul (Informatique) Algorithmes. Théorie de l'approximation. Polynômes. algorithms. aat COMPUTERS Programming Open Source. bisacsh COMPUTERS Software Development & Engineering Tools. bisacsh COMPUTERS Software Development & Engineering General. bisacsh Approximation theory fast Computational complexity fast Computer algorithms fast Polynomials fast Electronic books. Print version: Goldreich, Oded. P, NP, and NP-completeness. New York : Cambridge University Press, 2010 9780521192484 (DLC) 2010023587 (OCoLC)642204747 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=335200 Volltext
spellingShingle	Goldreich, Oded P, NP, and NP-completeness : the basics of computational complexity / Computational tasks and models -- The P versus NP question -- Polynomial-time reductions -- NP-completeness -- Three relatively advanced topics -- Epilogue: a brief overview of complexity theory. Computational complexity. http://id.loc.gov/authorities/subjects/sh85029473 Computer algorithms. http://id.loc.gov/authorities/subjects/sh91000149 Approximation theory. http://id.loc.gov/authorities/subjects/sh85006190 Polynomials. http://id.loc.gov/authorities/subjects/sh85104702 Algorithms https://id.nlm.nih.gov/mesh/D000465 Complexité de calcul (Informatique) Algorithmes. Théorie de l'approximation. Polynômes. algorithms. aat COMPUTERS Programming Open Source. bisacsh COMPUTERS Software Development & Engineering Tools. bisacsh COMPUTERS Software Development & Engineering General. bisacsh Approximation theory fast Computational complexity fast Computer algorithms fast Polynomials fast
subject_GND	http://id.loc.gov/authorities/subjects/sh85029473 http://id.loc.gov/authorities/subjects/sh91000149 http://id.loc.gov/authorities/subjects/sh85006190 http://id.loc.gov/authorities/subjects/sh85104702 https://id.nlm.nih.gov/mesh/D000465
title	P, NP, and NP-completeness : the basics of computational complexity /
title_auth	P, NP, and NP-completeness : the basics of computational complexity /
title_exact_search	P, NP, and NP-completeness : the basics of computational complexity /
title_full	P, NP, and NP-completeness : the basics of computational complexity / Oded Goldreich.
title_fullStr	P, NP, and NP-completeness : the basics of computational complexity / Oded Goldreich.
title_full_unstemmed	P, NP, and NP-completeness : the basics of computational complexity / Oded Goldreich.
title_short	P, NP, and NP-completeness :
title_sort	p np and np completeness the basics of computational complexity
title_sub	the basics of computational complexity /
topic	Computational complexity. http://id.loc.gov/authorities/subjects/sh85029473 Computer algorithms. http://id.loc.gov/authorities/subjects/sh91000149 Approximation theory. http://id.loc.gov/authorities/subjects/sh85006190 Polynomials. http://id.loc.gov/authorities/subjects/sh85104702 Algorithms https://id.nlm.nih.gov/mesh/D000465 Complexité de calcul (Informatique) Algorithmes. Théorie de l'approximation. Polynômes. algorithms. aat COMPUTERS Programming Open Source. bisacsh COMPUTERS Software Development & Engineering Tools. bisacsh COMPUTERS Software Development & Engineering General. bisacsh Approximation theory fast Computational complexity fast Computer algorithms fast Polynomials fast
topic_facet	Computational complexity. Computer algorithms. Approximation theory. Polynomials. Algorithms Complexité de calcul (Informatique) Algorithmes. Théorie de l'approximation. Polynômes. algorithms. COMPUTERS Programming Open Source. COMPUTERS Software Development & Engineering Tools. COMPUTERS Software Development & Engineering General. Approximation theory Computational complexity Computer algorithms Polynomials Electronic books.
url	https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=335200
work_keys_str_mv	AT goldreichoded pnpandnpcompletenessthebasicsofcomputationalcomplexity

Verfügbarkeit

MARC

Datensatz im Suchindex

Ähnliche Einträge