P, NP, and NP-completeness: the basics of computational complexity
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge [u.a.]
Cambridge Univ. Press
2010
|
| Ausgabe: | 1. publ. |
| Schlagworte: | |
| Online-Zugang: | Cover Inhaltsverzeichnis |
| Beschreibung: | Hier auch später erschienene, unveränderte Nachdrucke |
| Beschreibung: | XXIX, 184 S. Ill. |
| ISBN: | 9780521192484 9780521122542 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV036612394 | ||
| 003 | DE-604 | ||
| 005 | 20150213 | ||
| 007 | t | ||
| 008 | 100811s2010 a||| |||| 00||| eng d | ||
| 010 | |a 2010023587 | ||
| 020 | |a 9780521192484 |c hardback |9 978-0-521-19248-4 | ||
| 020 | |a 9780521122542 |c pbk. |9 978-0-521-12254-2 | ||
| 035 | |a (OCoLC)705730748 | ||
| 035 | |a (DE-599)GBV62989681X | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-20 |a DE-83 |a DE-355 |a DE-92 |a DE-29T |a DE-11 |a DE-473 | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 100 | 1 | |a Goldreich, Oded |d 1957- |e Verfasser |0 (DE-588)120549255 |4 aut | |
| 245 | 1 | 0 | |a P, NP, and NP-completeness |b the basics of computational complexity |c Oded Goldreich |
| 250 | |a 1. publ. | ||
| 264 | 1 | |a Cambridge [u.a.] |b Cambridge Univ. Press |c 2010 | |
| 300 | |a XXIX, 184 S. |b Ill. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Hier auch später erschienene, unveränderte Nachdrucke | ||
| 650 | 0 | |a Computational complexity | |
| 650 | 0 | |a Computer algorithms | |
| 650 | 0 | |a Approximation theory | |
| 650 | 0 | |a Polynomials | |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a NP-vollständiges Problem |0 (DE-588)4138229-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungstheorie |0 (DE-588)4005581-4 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a NP-vollständiges Problem |0 (DE-588)4138229-8 |D s |
| 689 | 0 | 1 | |a Berechnungstheorie |0 (DE-588)4005581-4 |D s |
| 689 | 0 | 2 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | |u http://assets.cambridge.org/97805211/92484/cover/9780521192484.jpg |3 Cover | |
| 856 | 4 | 2 | |m Digitalisierung UB Bamberg - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020532620&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-020532620 | ||
Datensatz im Suchindex
| _version_ | 1804143218653134848 |
|---|---|
| adam_text | Contents page xi xiii xvii xxi xxv xxvii List of Figures Preface Overview To the Teacher Notations and Conventions Main Definitions and Results 1 1.1 1.2 1.3 Computational Tasks and Models Teaching Notes Representation Computational Tasks 1.2.1 Search Problems 1.2.2 Decision Problems 1.2.3 Promise Problems (an Advanced Comment) Uniform Models (Algorithms) 1.3.1 Overview and General Principles 1.3.2 A Concrete Model: Turing Machines 1.3.2.1 The Actual Model 1.3.2.2 The Church-Turing Thesis 1.3.3 Uncomputable Functions 1.3.3.1 On the Existence of Uncomputable Functions 1.3.3.2 The Halting Problem 1.3.3.3 A Few More Undecidability Results 1.3.4 Universal Algorithms 1.3.4.1 The Existence of Universal Algorithms 1.3.4.2 A Detour: Kolmogorov Complexity 1.3.5 Time (and Space) Complexity vii 1 2 3 5 5 6 8 8 9 11 12 16 18 18 19 21 22 23 24 26
viii Contents 1.3.6 Oracle Machines and Turing-Reductions 1.3.7 Restricted Models 1.4 Non-Uniform Models (Circuits and Advice) 1.4.1 Boolean Circuits 1.4.1.1 The Basic Model 1.4.1.2 Circuit Complexity 1.4.2 Machines That Take Advice 1.4.3 Restricted Models 1.4.3.1 Boolean Formulae 1.4.3.2 Other Restricted Classes of Circuits 1.5 Complexity Classes Exercises 29 31 31 32 32 35 36 37 38 39 40 41 2 48 49 50 53 54 2.1 2.2 2.3 2.4 2.5 2.6 2.7 2.8 3 The P versus NP Question Teaching Notes Efficient Computation The Search Version: Finding versus Checking 2.2.1 The Class P as a Natural Class of Search Problems 2.2.2 The Class NP as Another Natural Class of Search Problems 56 2.2.3 The P versus NP Question in Terms of Search Problems The Decision Version: Proving versus Verifying 2.3.1 The Class P as a Natural Class of Decision Problems 2.3.2 The Class NP and NP-Proof Systems 2.3.3 The P versus NP Question in Terms of Decision Problems Equivalence of the Two Formulations Technical Comments Regarding NP The Traditional Definition of NP In Support of P Being Different from NP Philosophical Meditations Exercises Polynomial-time Reductions Teaching Notes 3.1 The General Notion of a Reduction 3.1.1 The Actual Formulation 3.1.2 Special Cases 3.1.3 Terminology and a Brief Discussion 3.2 Reducing Optimization Problems to Search Problems 57 58 59 59 62 63 65 66 69 70 71 74 75 75 76 77 79 81
г Contents 3.3 Self-Reducibility of Search Problems 3.3.1 Examples 3.3.2 Self-Reducibility of NP-Complete Problems 3.4 Digest and General Perspective Exercises 4 ix 83 85 87 88 89 NP-Completeness Teaching Notes Definitions The Existence of NP-Complete Problems Bounded Halting and Non-Halting Some Natural NP-Complete Problems 4.3.1 Circuit and Formula Satisfiability: CSAT and SAT 4.3.1.1 The NP-Completeness of CSAT 4.3.1.2 The NP-Completeness of SAT 4.3.2 Combinatorics and Graph Theory 4.3.3 Additional Properties of the Standard Reductions 4.3.4 On the Negative Application of NP-Completeness 4.3.5 Positive Applications of NP-Completeness NP Sets That Are Neither in P nor NP-Complete Reflections on Complete Problems Exercises 96 97 98 99 102 103 104 105 109 113 120 121 122 126 130 133 Three Relatively Advanced Topics Teaching Notes 5.1 Promise Problems 5.1.1 Definitions 5.1.1.1 Search Problems with a Promise 5.1.1.2 Decision Problems with a Promise 5.1.1.3 Reducibility Among Promise Problems 5.1.2 Applications and Limitations 5.1.2.1 Formulating Natural Computational Problems 5.1.2.2 Restricting a Computational Problem 5.1.2.3 Non-generic Applications 5.1.2.4 Limitations 5.1.3 The Standard Convention of Avoiding Promise Problems 5.2 Optimal Search Algorithms for NP 5.3 The Class coNP and Its Intersection with NP Exercises 142 142 142 143 143 144 145 146 146 147 147 148 149 151 154 158 4.1 4.2 4.3 4.4 4.5 5
X Contents Historical Notes 165 Epilogue: A Brief Overview of Complexity Theory 169 Appendix: Some Computational Problems A.l Graphs A.2 Boolean Formulae 177 177 179 Bibliography Index 181 183
|
| any_adam_object | 1 |
| author | Goldreich, Oded 1957- |
| author_GND | (DE-588)120549255 |
| author_facet | Goldreich, Oded 1957- |
| author_role | aut |
| author_sort | Goldreich, Oded 1957- |
| author_variant | o g og |
| building | Verbundindex |
| bvnumber | BV036612394 |
| classification_rvk | ST 134 |
| ctrlnum | (OCoLC)705730748 (DE-599)GBV62989681X |
| discipline | Informatik |
| edition | 1. publ. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01985nam a2200469 c 4500</leader><controlfield tag="001">BV036612394</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20150213 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">100811s2010 a||| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2010023587</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521192484</subfield><subfield code="c">hardback</subfield><subfield code="9">978-0-521-19248-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521122542</subfield><subfield code="c">pbk.</subfield><subfield code="9">978-0-521-12254-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)705730748</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV62989681X</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-20</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-473</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Goldreich, Oded</subfield><subfield code="d">1957-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)120549255</subfield><subfield code="4">aut</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="250" ind1=" " ind2=" "><subfield code="a">1. publ.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge [u.a.]</subfield><subfield code="b">Cambridge Univ. Press</subfield><subfield code="c">2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXIX, 184 S.</subfield><subfield code="b">Ill.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Hier auch später erschienene, unveränderte Nachdrucke</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Approximation theory</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Polynomials</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">NP-vollständiges Problem</subfield><subfield code="0">(DE-588)4138229-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungstheorie</subfield><subfield code="0">(DE-588)4005581-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">NP-vollständiges Problem</subfield><subfield code="0">(DE-588)4138229-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Berechnungstheorie</subfield><subfield code="0">(DE-588)4005581-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://assets.cambridge.org/97805211/92484/cover/9780521192484.jpg</subfield><subfield code="3">Cover</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bamberg - ADAM Catalogue Enrichment</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020532620&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-020532620</subfield></datafield></record></collection> |
| id | DE-604.BV036612394 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T22:44:10Z |
| institution | BVB |
| isbn | 9780521192484 9780521122542 |
| language | English |
| lccn | 2010023587 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-020532620 |
| oclc_num | 705730748 |
| open_access_boolean | |
| owner | DE-20 DE-83 DE-355 DE-BY-UBR DE-92 DE-29T DE-11 DE-473 DE-BY-UBG |
| owner_facet | DE-20 DE-83 DE-355 DE-BY-UBR DE-92 DE-29T DE-11 DE-473 DE-BY-UBG |
| physical | XXIX, 184 S. Ill. |
| publishDate | 2010 |
| publishDateSearch | 2010 |
| publishDateSort | 2010 |
| publisher | Cambridge Univ. Press |
| record_format | marc |
| spelling | Goldreich, Oded 1957- Verfasser (DE-588)120549255 aut P, NP, and NP-completeness the basics of computational complexity Oded Goldreich 1. publ. Cambridge [u.a.] Cambridge Univ. Press 2010 XXIX, 184 S. Ill. txt rdacontent n rdamedia nc rdacarrier Hier auch später erschienene, unveränderte Nachdrucke Computational complexity Computer algorithms Approximation theory Polynomials Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf NP-vollständiges Problem (DE-588)4138229-8 gnd rswk-swf Berechnungstheorie (DE-588)4005581-4 gnd rswk-swf NP-vollständiges Problem (DE-588)4138229-8 s Berechnungstheorie (DE-588)4005581-4 s Komplexitätstheorie (DE-588)4120591-1 s DE-604 http://assets.cambridge.org/97805211/92484/cover/9780521192484.jpg Cover Digitalisierung UB Bamberg - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020532620&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Goldreich, Oded 1957- P, NP, and NP-completeness the basics of computational complexity Computational complexity Computer algorithms Approximation theory Polynomials Komplexitätstheorie (DE-588)4120591-1 gnd NP-vollständiges Problem (DE-588)4138229-8 gnd Berechnungstheorie (DE-588)4005581-4 gnd |
| subject_GND | (DE-588)4120591-1 (DE-588)4138229-8 (DE-588)4005581-4 |
| 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 Computer algorithms Approximation theory Polynomials Komplexitätstheorie (DE-588)4120591-1 gnd NP-vollständiges Problem (DE-588)4138229-8 gnd Berechnungstheorie (DE-588)4005581-4 gnd |
| topic_facet | Computational complexity Computer algorithms Approximation theory Polynomials Komplexitätstheorie NP-vollständiges Problem Berechnungstheorie |
| url | http://assets.cambridge.org/97805211/92484/cover/9780521192484.jpg http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020532620&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT goldreichoded pnpandnpcompletenessthebasicsofcomputationalcomplexity |