Computers and intractability: a guide to the theory of NP-completeness
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New York
W.H. Freeman and Company
[ca. 2008]
|
| Ausgabe: | Twenty-seventh printing |
| Schriftenreihe: | A series of books in the mathematical sciences
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | X, 338 Seiten Illustrationen, Diagramme |
| ISBN: | 9780716710455 9780716710448 0716710447 0716710455 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV035386541 | ||
| 003 | DE-604 | ||
| 005 | 20210929 | ||
| 007 | t| | ||
| 008 | 090323s2008 xx a||| |||| 00||| eng d | ||
| 020 | |a 9780716710455 |c pbk. |9 978-0-7167-1045-5 | ||
| 020 | |a 9780716710448 |c hbk. |9 978-0-7167-1044-8 | ||
| 020 | |a 0716710447 |9 0-7167-1044-7 | ||
| 020 | |a 0716710455 |9 0-7167-1045-5 | ||
| 035 | |a (OCoLC)601793845 | ||
| 035 | |a (DE-599)BVBBV035386541 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-M347 |a DE-703 |a DE-634 | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a DAT 517f |2 stub | ||
| 100 | 1 | |a Garey, Michael Randolph |d 1945- |e Verfasser |0 (DE-588)1180048075 |4 aut | |
| 245 | 1 | 0 | |a Computers and intractability |b a guide to the theory of NP-completeness |c Michael R. Garey ; David S. Johnson |
| 250 | |a Twenty-seventh printing | ||
| 264 | 1 | |a New York |b W.H. Freeman and Company |c [ca. 2008] | |
| 300 | |a X, 338 Seiten |b Illustrationen, Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a A series of books in the mathematical sciences | |
| 650 | 0 | 7 | |a Grundlage |0 (DE-588)4158388-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Neurolinguistisches Programmieren |0 (DE-588)4192909-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datenverarbeitung |0 (DE-588)4011152-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Altkirchenslawisch |0 (DE-588)4085065-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmierung |0 (DE-588)4076370-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mathematik |0 (DE-588)4037944-9 |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 Komplexität |0 (DE-588)4135369-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 651 | 7 | |a Fischkaltersee |0 (DE-588)4017327-6 |2 gnd |9 rswk-swf | |
| 651 | 7 | |a Chittagong Hill Tracts |0 (DE-588)4010001-7 |2 gnd |9 rswk-swf | |
| 651 | 7 | |a Alaska |0 (DE-588)4001016-8 |2 gnd |9 rswk-swf | |
| 689 | 0 | 0 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a NP-vollständiges Problem |0 (DE-588)4138229-8 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Datenverarbeitung |0 (DE-588)4011152-0 |D s |
| 689 | 2 | 1 | |a Mathematik |0 (DE-588)4037944-9 |D s |
| 689 | 2 | 2 | |a Grundlage |0 (DE-588)4158388-7 |D s |
| 689 | 2 | |8 1\p |5 DE-604 | |
| 689 | 3 | 0 | |a Altkirchenslawisch |0 (DE-588)4085065-1 |D s |
| 689 | 3 | 1 | |a Alaska |0 (DE-588)4001016-8 |D g |
| 689 | 3 | 2 | |a Fischkaltersee |0 (DE-588)4017327-6 |D g |
| 689 | 3 | |8 2\p |5 DE-604 | |
| 689 | 4 | 0 | |a Datenverarbeitung |0 (DE-588)4011152-0 |D s |
| 689 | 4 | 1 | |a Neurolinguistisches Programmieren |0 (DE-588)4192909-3 |D s |
| 689 | 4 | |8 3\p |5 DE-604 | |
| 689 | 5 | 0 | |a Komplexität |0 (DE-588)4135369-9 |D s |
| 689 | 5 | |8 4\p |5 DE-604 | |
| 689 | 6 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 6 | |8 5\p |5 DE-604 | |
| 689 | 7 | 0 | |a Programmierung |0 (DE-588)4076370-5 |D s |
| 689 | 7 | |8 6\p |5 DE-604 | |
| 689 | 8 | 0 | |a Chittagong Hill Tracts |0 (DE-588)4010001-7 |D g |
| 689 | 8 | |8 7\p |5 DE-604 | |
| 700 | 1 | |a Johnson, David Stifler |d 1945-2016 |e Verfasser |0 (DE-588)118004858X |4 aut | |
| 856 | 4 | 2 | |m Digitalisierung UB Bayreuth |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017307401&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 4\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 5\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 6\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 7\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-017307401 | |
Datensatz im Suchindex
| _version_ | 1818768286157897728 |
|---|---|
| adam_text |
Contents
Preface
.
¡x
1 Computers,
Complexity, and Intractability
.1
1.1
Introduction
.1
1.2
Problems, Algorithms, and Complexity
.4
1.3
Polynomial Time Algorithms and Intractable Problems
.6
1.4
Provably
Intractable Problems
.
U
1.5
NP-Complete Problems
.13
1.6
An Outline of
lhe
Book
.14
2
The Theory of NP-Completeness
.17
2.1
Decision Problems, Languages, and Encoding Schemes
.18
2.2
Deterministic Turing Machines and the Class
P
.23
2.3
Nondeterministic Computation and the Class NP
.27
2.4
The Relationship Between
P
and NP
.32
2.5
Polynomial Transformations and NP-Compleieness
.34
2.6
Cook's Theorem
.38
3
Proving NP-Completeness Results
.45
3.1
Six Basic NP-Complete Problems
.46
3.1.1
S-SATISFIABILITY
.48
3.1.2
S-DIMENSIONAL MATCHING
.50
3.1.3
VERTEX COVER and CLIQUE
.53
3.1.4
HAMILTONIAN CIRCUIT
.56
3.1.5
PARTITION
.60
3.2
Some Techniques for Proving NP-Completeness
.63
3.2.1
Restriction
.63
3.2.2
Local Replacement
.66
3.2.3
Component Design
.72
3.3
Some Suggested Exercises
.74
v¡
CONTENTS
4
Using NP-Completeness to Analyze Problems
.77
4.1
Analyzing Subproblems
.80
4.2
Number Problems and Strong NP-Completeness
.90
4.2.1
Some Additional Definitions
.92
4.2.2
Proving Strong NP-Completeness Results
.95
4.3
Time Complexity as a Function of Natural Parameters
. 106
5
NP-Hardness
.109
5.1
Turing Reducibility and NP-Hard Problems
.109
5.2
A Terminological History
.118
6
Coping with NP-Complete Problems
.121
6.1
Performance Guarantees for Approximation Algorithms
. 123
6.2
Applying NP-Completeness to Approximation Problems
. . .137
6.3
Performance Guarantees and Behavior "In Practice"
.148
7
Beyond NP-Completeness
.153
7.1
The Structure of NP
.154
7.2
The Polynomial Hierarchy
.161
7.3
The Complexity of Enumeration Problems
.167
7.4
Polynomial Space Completeness
.170
7.5
Logarithmic Space
.177
7.6
Proofs of Intractability and
Ρ
vs. NP
.181
Appendix: A List of NP-Complete Problems
.187
Al
Graph Theory
.190
Al.l Covering and Partitioning
.190
Al.
2
Subgraphs and Supergraphs
.194
A1.3 Vertex Ordering
.199
Al.
4
Iso- and Other Morphisms
.202
Al.
5
Miscellaneous
.203
A2 Network Design
.206
A2.
1
Spanning Trees
.206
A2.2 Cuts and Connectivity
.209
A2.3 Routing Problems
.211
A2.4 Flow Problems
.214
A2.5 Miscellaneous
.218
A3
Sets and Partitions
.221
A3.1 Covering, Hitting, and Splitting
.221
A3.2 Weighted Set Problems
.223
A4
Storage and Retrieval
.226
A4.1 Data Storage
.226
A4.2 Compression and Representation
.228
A4.3 Database Problems
.232
CONTENTS
VU
A5
Sequencing and Scheduling
.236
A5.1 Sequencing on One Processor
.236
A5.2 Multiprocessor Scheduling
.238
A5.3 Shop Scheduling
.241
A5.4 Miscellaneous
.243
A6 Mathematical Programming
.245
A7 Algebra and Number Theory
.249
A7.1 Divisibility Problems
.249
A7.2 Solvability of Equations
.250
A7.3 Miscellaneous
.252
A8 Games and Puzzles
.254
A9 Logic
.259
A9.1 Propositional Logic
.259
A9.2 Miscellaneous
.261
AIO
Automata and Language Theory
.265
A10.1 Automata Theory
.265
A10.2 Formal Languages
.267
All Program Optimization
.272
All.l Code Generation
.272
Al
1.2
Programs and Schemes
.275
A12 Miscellaneous
.279
A13 Open Problems
.285
Symbol Index
.289
Reference and Author Index
.291
Subject Index
.327
Update for the Current Printing
.339 |
| any_adam_object | 1 |
| author | Garey, Michael Randolph 1945- Johnson, David Stifler 1945-2016 |
| author_GND | (DE-588)1180048075 (DE-588)118004858X |
| author_facet | Garey, Michael Randolph 1945- Johnson, David Stifler 1945-2016 |
| author_role | aut aut |
| author_sort | Garey, Michael Randolph 1945- |
| author_variant | m r g mr mrg d s j ds dsj |
| building | Verbundindex |
| bvnumber | BV035386541 |
| classification_rvk | ST 130 ST 134 |
| classification_tum | DAT 517f |
| ctrlnum | (OCoLC)601793845 (DE-599)BVBBV035386541 |
| discipline | Informatik |
| edition | Twenty-seventh printing |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV035386541</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210929</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">090323s2008 xx a||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780716710455</subfield><subfield code="c">pbk.</subfield><subfield code="9">978-0-7167-1045-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780716710448</subfield><subfield code="c">hbk.</subfield><subfield code="9">978-0-7167-1044-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0716710447</subfield><subfield code="9">0-7167-1044-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0716710455</subfield><subfield code="9">0-7167-1045-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)601793845</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035386541</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</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="084" ind1=" " ind2=" "><subfield code="a">DAT 517f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Garey, Michael Randolph</subfield><subfield code="d">1945-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1180048075</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computers and intractability</subfield><subfield code="b">a guide to the theory of NP-completeness</subfield><subfield code="c">Michael R. Garey ; David S. Johnson</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Twenty-seventh printing</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York</subfield><subfield code="b">W.H. Freeman and Company</subfield><subfield code="c">[ca. 2008]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 338 Seiten</subfield><subfield code="b">Illustrationen, Diagramme</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="490" ind1="0" ind2=" "><subfield code="a">A series of books in the mathematical sciences</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Grundlage</subfield><subfield code="0">(DE-588)4158388-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Neurolinguistisches Programmieren</subfield><subfield code="0">(DE-588)4192909-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Altkirchenslawisch</subfield><subfield code="0">(DE-588)4085065-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</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">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="651" ind1=" " ind2="7"><subfield code="a">Fischkaltersee</subfield><subfield code="0">(DE-588)4017327-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="651" ind1=" " ind2="7"><subfield code="a">Chittagong Hill Tracts</subfield><subfield code="0">(DE-588)4010001-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="651" ind1=" " ind2="7"><subfield code="a">Alaska</subfield><subfield code="0">(DE-588)4001016-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="2"><subfield code="a">Grundlage</subfield><subfield code="0">(DE-588)4158388-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Altkirchenslawisch</subfield><subfield code="0">(DE-588)4085065-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="1"><subfield code="a">Alaska</subfield><subfield code="0">(DE-588)4001016-8</subfield><subfield code="D">g</subfield></datafield><datafield tag="689" ind1="3" ind2="2"><subfield code="a">Fischkaltersee</subfield><subfield code="0">(DE-588)4017327-6</subfield><subfield code="D">g</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2="1"><subfield code="a">Neurolinguistisches Programmieren</subfield><subfield code="0">(DE-588)4192909-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" ind2="0"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="6" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="6" ind2=" "><subfield code="8">5\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="7" ind2="0"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="7" ind2=" "><subfield code="8">6\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="8" ind2="0"><subfield code="a">Chittagong Hill Tracts</subfield><subfield code="0">(DE-588)4010001-7</subfield><subfield code="D">g</subfield></datafield><datafield tag="689" ind1="8" ind2=" "><subfield code="8">7\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Johnson, David Stifler</subfield><subfield code="d">1945-2016</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)118004858X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bayreuth</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=017307401&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">4\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">5\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">6\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">7\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017307401</subfield></datafield></record></collection> |
| geographic | Fischkaltersee (DE-588)4017327-6 gnd Chittagong Hill Tracts (DE-588)4010001-7 gnd Alaska (DE-588)4001016-8 gnd |
| geographic_facet | Fischkaltersee Chittagong Hill Tracts Alaska |
| id | DE-604.BV035386541 |
| illustrated | Illustrated |
| indexdate | 2024-12-18T09:03:21Z |
| institution | BVB |
| isbn | 9780716710455 9780716710448 0716710447 0716710455 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017307401 |
| oclc_num | 601793845 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-M347 DE-703 DE-634 |
| owner_facet | DE-91G DE-BY-TUM DE-M347 DE-703 DE-634 |
| physical | X, 338 Seiten Illustrationen, Diagramme |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | W.H. Freeman and Company |
| record_format | marc |
| series2 | A series of books in the mathematical sciences |
| spelling | Garey, Michael Randolph 1945- Verfasser (DE-588)1180048075 aut Computers and intractability a guide to the theory of NP-completeness Michael R. Garey ; David S. Johnson Twenty-seventh printing New York W.H. Freeman and Company [ca. 2008] X, 338 Seiten Illustrationen, Diagramme txt rdacontent n rdamedia nc rdacarrier A series of books in the mathematical sciences Grundlage (DE-588)4158388-7 gnd rswk-swf Neurolinguistisches Programmieren (DE-588)4192909-3 gnd rswk-swf Datenverarbeitung (DE-588)4011152-0 gnd rswk-swf Altkirchenslawisch (DE-588)4085065-1 gnd rswk-swf Programmierung (DE-588)4076370-5 gnd rswk-swf Mathematik (DE-588)4037944-9 gnd rswk-swf NP-vollständiges Problem (DE-588)4138229-8 gnd rswk-swf Komplexität (DE-588)4135369-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Fischkaltersee (DE-588)4017327-6 gnd rswk-swf Chittagong Hill Tracts (DE-588)4010001-7 gnd rswk-swf Alaska (DE-588)4001016-8 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 s DE-604 NP-vollständiges Problem (DE-588)4138229-8 s Datenverarbeitung (DE-588)4011152-0 s Mathematik (DE-588)4037944-9 s Grundlage (DE-588)4158388-7 s 1\p DE-604 Altkirchenslawisch (DE-588)4085065-1 s Alaska (DE-588)4001016-8 g Fischkaltersee (DE-588)4017327-6 g 2\p DE-604 Neurolinguistisches Programmieren (DE-588)4192909-3 s 3\p DE-604 Komplexität (DE-588)4135369-9 s 4\p DE-604 Algorithmus (DE-588)4001183-5 s 5\p DE-604 Programmierung (DE-588)4076370-5 s 6\p DE-604 Chittagong Hill Tracts (DE-588)4010001-7 g 7\p DE-604 Johnson, David Stifler 1945-2016 Verfasser (DE-588)118004858X aut Digitalisierung UB Bayreuth application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017307401&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 5\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 6\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 7\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Garey, Michael Randolph 1945- Johnson, David Stifler 1945-2016 Computers and intractability a guide to the theory of NP-completeness Grundlage (DE-588)4158388-7 gnd Neurolinguistisches Programmieren (DE-588)4192909-3 gnd Datenverarbeitung (DE-588)4011152-0 gnd Altkirchenslawisch (DE-588)4085065-1 gnd Programmierung (DE-588)4076370-5 gnd Mathematik (DE-588)4037944-9 gnd NP-vollständiges Problem (DE-588)4138229-8 gnd Komplexität (DE-588)4135369-9 gnd Algorithmus (DE-588)4001183-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| subject_GND | (DE-588)4158388-7 (DE-588)4192909-3 (DE-588)4011152-0 (DE-588)4085065-1 (DE-588)4076370-5 (DE-588)4037944-9 (DE-588)4138229-8 (DE-588)4135369-9 (DE-588)4001183-5 (DE-588)4134751-1 (DE-588)4017327-6 (DE-588)4010001-7 (DE-588)4001016-8 |
| title | Computers and intractability a guide to the theory of NP-completeness |
| title_auth | Computers and intractability a guide to the theory of NP-completeness |
| title_exact_search | Computers and intractability a guide to the theory of NP-completeness |
| title_full | Computers and intractability a guide to the theory of NP-completeness Michael R. Garey ; David S. Johnson |
| title_fullStr | Computers and intractability a guide to the theory of NP-completeness Michael R. Garey ; David S. Johnson |
| title_full_unstemmed | Computers and intractability a guide to the theory of NP-completeness Michael R. Garey ; David S. Johnson |
| title_short | Computers and intractability |
| title_sort | computers and intractability a guide to the theory of np completeness |
| title_sub | a guide to the theory of NP-completeness |
| topic | Grundlage (DE-588)4158388-7 gnd Neurolinguistisches Programmieren (DE-588)4192909-3 gnd Datenverarbeitung (DE-588)4011152-0 gnd Altkirchenslawisch (DE-588)4085065-1 gnd Programmierung (DE-588)4076370-5 gnd Mathematik (DE-588)4037944-9 gnd NP-vollständiges Problem (DE-588)4138229-8 gnd Komplexität (DE-588)4135369-9 gnd Algorithmus (DE-588)4001183-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| topic_facet | Grundlage Neurolinguistisches Programmieren Datenverarbeitung Altkirchenslawisch Programmierung Mathematik NP-vollständiges Problem Komplexität Algorithmus Berechnungskomplexität Fischkaltersee Chittagong Hill Tracts Alaska |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017307401&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT gareymichaelrandolph computersandintractabilityaguidetothetheoryofnpcompleteness AT johnsondavidstifler computersandintractabilityaguidetothetheoryofnpcompleteness |