Complexity theory: exploring the limits of efficient algorithms
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2005
|
| Schlagwörter: | |
| Links: | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=013160413&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| Umfang: | XI, 308 S. graph. Darst. |
| ISBN: | 3540210458 9783540210450 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV019835418 | ||
| 003 | DE-604 | ||
| 005 | 20051123 | ||
| 007 | t| | ||
| 008 | 050607s2005 gw d||| |||| 00||| eng d | ||
| 016 | 7 | |a 970163924 |2 DE-101 | |
| 020 | |a 3540210458 |9 3-540-21045-8 | ||
| 020 | |a 9783540210450 |9 978-3-540-21045-0 | ||
| 035 | |a (OCoLC)249520145 | ||
| 035 | |a (DE-599)BVBBV019835418 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-703 |a DE-473 |a DE-91G |a DE-573 |a DE-634 |a DE-83 |a DE-11 |a DE-739 | ||
| 050 | 0 | |a QA9.58 | |
| 082 | 0 | |a 518.1 | |
| 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 | ||
| 084 | |a 68Q15 |2 msc | ||
| 084 | |a 68Q17 |2 msc | ||
| 084 | |a 004 |2 sdnb | ||
| 100 | 1 | |a Wegener, Ingo |d 1950-2008 |e Verfasser |0 (DE-588)121274276 |4 aut | |
| 240 | 1 | 0 | |a Komplexitätstheorie |
| 245 | 1 | 0 | |a Complexity theory |b exploring the limits of efficient algorithms |c Ingo Wegener |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2005 | |
| 300 | |a XI, 308 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Komplexitätstheorie - Lehrbuch | |
| 650 | 4 | |a Algorithms | |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)4123623-3 |a Lehrbuch |2 gnd-content | |
| 689 | 0 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 775 | 0 | 8 | |i Paralle Sprachausgabe |n deutsch |a Wegener, Ingo |t Komplexitätstheorie |
| 856 | 4 | 2 | |m Digitalisierung UB Passau |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=013160413&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 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-013160413 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0102 DAT 517f 2005 A 9060 0104 DAT 517f 2005 A 9060 |
|---|---|
| DE-BY-TUM_katkey | 1525527 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040071007162 040020059372 |
| _version_ | 1821932679789019136 |
| adam_text | Contents
1
Introduction
............................................... 1
1.1
What Is Complexity Theory?
............................. 1
1.2
Didactic Background
..................................... 5
1.3
Overview
............................................... 6
1.4
Additional Literature
.................................... 10
2
Algorithmic Problems
&
Their Complexity
................ 11
2.1
What Are Algorithmic Problems?
......................... 11
2.2
Some Important Algorithmic Problems
..................... 13
2.3
Measuring Computation Time
............................ 18
2.4
The Complexity of Algorithmic Problems
................... 22
3
Fundamental Complexity Classes
.......................... 25
3.1
The Special Role of Polynomial Computation Time
.......... 25
3.2
Randomized Algorithms
.................................. 27
3.3
The Fundamental Complexity Classes for Algorithmic Problems
30
3.4
The Fundamental Complexity Classes for Decision Problems
. . 35
3.5
Nondeterminism as a Special Case of Randomization
......... 39
4
Reductions
-
Algorithmic Relationships Between Problems
43
4.1
When Are Two Problems Algorithmically Similar?
........... 43
4.2
Reductions Between Various Variants of a Problem
.......... 46
4.3
Reductions Between Related Problems
..................... 49
4.4
Reductions Between Unrelated Problems
................... 53
4.5
The Special Role of Polynomial Reductions
................. 60
5
The Theory of NP-Completeness
.......................... 63
5.1
Fundamental Considerations
.............................. 63
5.2
Problems in NP
......................................... 67
5.3
Alternative Characterizations of NP
....................... 69
5.4
Cook s Theorem
......................................... 70
6
NP-complete and NP-equivalent Problems
................. 77
6.1 Fundamental
Considerations
.............................. 77
6.2
Traveling Salesperson Problems
........................... 77
6.3
Knapsack Problems
...................................... 78
6.4
Partitioning and Scheduling Problems
...................... 80
6.5
Clique Problems
......................................... 81
6.6
Team Building Problems
................................. 83
6.7
Championship Problems
.................................. 85
7
The Complexity Analysis of Problems
..................... 89
7.1
The Dividing Line Between Easy and Hard
................. 89
7.2
Pseudo-polynomial Algorithms and Strong NP-completeness
.. 93
7.3
An Overview of the NP-completeness Proofs Considered
...... 96
8
The Complexity of Approximation Problems
-
Classical
Results
.................................................... 99
8.1
Complexity Classes
...................................... 99
8.2
Approximation Algorithms
...............................103
8.3
The Gap Technique
......................................106
8.4
Approximation-Preserving Reductions
......................109
8.5
Complete Approximation Problems
........................112
9
The Complexity of Black Box Problems
...................115
9.1
Black Box Optimization
..................................115
9.2
Yao s Minimax Principle
.................................118
9.3
Lower Bounds for Black Box Complexity
...................120
10
Additional Complexity Classes
.............................127
10.1
Fundamental Considerations
..............................127
10.2
Complexity Classes Within NP and co-NP
..................128
10.3
Oracle Classes
..........................................130
10.4
The Polynomial Hierarchy
.................................132
10.5
BPP, NP, and the Polynomial Hierarchy
....................138
11
Interactive Proofs
..................
í
......................145
11.1
Fundamental Considerations
..............................145
11.2
Interactive Proof Systems
................................147
11.3
Regarding the Complexity of Graph Isomorphism Problems
. . . 148
11.4
Zero-Knowledge Proofs
...................................155
12
The
PCP
Theorem and the Complexity o;f Approximation
Problems
...................................................161
12.1
Randomized Verification of Proofs
....... ..................161
12.2
The
PCP
Theorem
....................;.................164
12.3
The
PCP
Theorem and Inapproximability Results
...........173
12.4
The
PCP
Theorem and APX-Completeness1,
.................177
13
Further Topics From Classical Complexity Theory
.........185
13.1
Overview
...............................................185
13.2
Space-Bounded Complexity Classes
........................186
13.3
PSPACE-complete Problems
..............................188
13.4
Nondeterminism and Determinism in the Context of Bounded
Space
..................................................191
13.5
Nondeterminism and Complementation with Precise Space
Bounds
................................................193
13.6
Complexity Classes Within
Ρ
.............................195
13.7
The Complexity of Counting Problems
.....................198
14
The Complexity of Non-uniform Problems
.................201
14.1
Fundamental Considerations
..............................201
14.2
The Simulation of Turing Machines By Circuits
.............204
14.3
The Simulation of Circuits by Non-uniform Turing Machines
. . 206
14.4
Branching Programs and Space Bounds
....................209
14.5
Polynomial Circuits for Problems in BPP
...................211
14.6
Complexity Classes for Computation with Help
.............212
14.7
Are There Polynomial Circuits for all Problems in NP?
.......214
15
Communication Complexity
...............................219
15.1
The Communication Game
...............................219
15.2
Lower Bounds for Communication Complexity
..............223
15.3
Nondeterministic Communication Protocols
.................233
15.4
Randomized Communication Protocols
.....................238
15.5
Communication Complexity and VLSI Circuits
..............246
15.6
Communication Complexity and Computation Time
.........247
16
The Complexity of Boolean Functions
.....................251
16.1
Fundamental Considerations
..............................251
16.2
Circuit Size
.............................................252
16.3
Circuit Depth
...........................................254
16.4
The Size of Depth-Bounded Circuits
.......................259
16.5
The Size of Depth-Bounded Threshold Circuits
..............264
16.6
The Size of Branching Programs
...........................26?
16.7
Reduction Notions
................................,......271
Final Comments
...............................................
2Y7
A Appendix
..................................................279
A.I Orders of Magnitude and
О
-Notation......................
279
A.
2
Results from Probability Theory
..........................283
References
.....................................................295
Index
..........................................................301
|
| any_adam_object | 1 |
| author | Wegener, Ingo 1950-2008 |
| author_GND | (DE-588)121274276 |
| author_facet | Wegener, Ingo 1950-2008 |
| author_role | aut |
| author_sort | Wegener, Ingo 1950-2008 |
| author_variant | i w iw |
| building | Verbundindex |
| bvnumber | BV019835418 |
| callnumber-first | Q - Science |
| callnumber-label | QA9 |
| callnumber-raw | QA9.58 |
| callnumber-search | QA9.58 |
| callnumber-sort | QA 19.58 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 130 ST 134 |
| classification_tum | DAT 517f |
| ctrlnum | (OCoLC)249520145 (DE-599)BVBBV019835418 |
| dewey-full | 518.1 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 518 - Numerical analysis |
| dewey-raw | 518.1 |
| dewey-search | 518.1 |
| dewey-sort | 3518.1 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01916nam a2200505 c 4500</leader><controlfield tag="001">BV019835418</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20051123 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">050607s2005 gw d||| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">970163924</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540210458</subfield><subfield code="9">3-540-21045-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783540210450</subfield><subfield code="9">978-3-540-21045-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)249520145</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV019835418</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA9.58</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">518.1</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="084" ind1=" " ind2=" "><subfield code="a">68Q15</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68Q17</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wegener, Ingo</subfield><subfield code="d">1950-2008</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121274276</subfield><subfield code="4">aut</subfield></datafield><datafield tag="240" ind1="1" ind2="0"><subfield code="a">Komplexitätstheorie</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Complexity theory</subfield><subfield code="b">exploring the limits of efficient algorithms</subfield><subfield code="c">Ingo Wegener</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2005</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XI, 308 S.</subfield><subfield code="b">graph. Darst.</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="650" ind1=" " ind2="4"><subfield code="a">Komplexitätstheorie - Lehrbuch</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</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="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4123623-3</subfield><subfield code="a">Lehrbuch</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><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="775" ind1="0" ind2="8"><subfield code="i">Paralle Sprachausgabe</subfield><subfield code="n">deutsch</subfield><subfield code="a">Wegener, Ingo</subfield><subfield code="t">Komplexitätstheorie</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau</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=013160413&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="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-013160413</subfield></datafield></record></collection> |
| genre | 1\p (DE-588)4123623-3 Lehrbuch gnd-content |
| genre_facet | Lehrbuch |
| id | DE-604.BV019835418 |
| illustrated | Illustrated |
| indexdate | 2024-12-20T12:06:54Z |
| institution | BVB |
| isbn | 3540210458 9783540210450 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-013160413 |
| oclc_num | 249520145 |
| open_access_boolean | |
| owner | DE-703 DE-473 DE-BY-UBG DE-91G DE-BY-TUM DE-573 DE-634 DE-83 DE-11 DE-739 |
| owner_facet | DE-703 DE-473 DE-BY-UBG DE-91G DE-BY-TUM DE-573 DE-634 DE-83 DE-11 DE-739 |
| physical | XI, 308 S. graph. Darst. |
| publishDate | 2005 |
| publishDateSearch | 2005 |
| publishDateSort | 2005 |
| publisher | Springer |
| record_format | marc |
| spellingShingle | Wegener, Ingo 1950-2008 Complexity theory exploring the limits of efficient algorithms Komplexitätstheorie - Lehrbuch Algorithms Komplexitätstheorie (DE-588)4120591-1 gnd |
| subject_GND | (DE-588)4120591-1 (DE-588)4123623-3 |
| title | Complexity theory exploring the limits of efficient algorithms |
| title_alt | Komplexitätstheorie |
| title_auth | Complexity theory exploring the limits of efficient algorithms |
| title_exact_search | Complexity theory exploring the limits of efficient algorithms |
| title_full | Complexity theory exploring the limits of efficient algorithms Ingo Wegener |
| title_fullStr | Complexity theory exploring the limits of efficient algorithms Ingo Wegener |
| title_full_unstemmed | Complexity theory exploring the limits of efficient algorithms Ingo Wegener |
| title_short | Complexity theory |
| title_sort | complexity theory exploring the limits of efficient algorithms |
| title_sub | exploring the limits of efficient algorithms |
| topic | Komplexitätstheorie - Lehrbuch Algorithms Komplexitätstheorie (DE-588)4120591-1 gnd |
| topic_facet | Komplexitätstheorie - Lehrbuch Algorithms Komplexitätstheorie Lehrbuch |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=013160413&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT wegeneringo komplexitatstheorie AT wegeneringo complexitytheoryexploringthelimitsofefficientalgorithms |
Inhaltsverzeichnis
Paper/Kapitel scannen lassen
Paper/Kapitel scannen lassen
Teilbibliothek Mathematik & Informatik
| Signatur: |
0102 DAT 517f 2005 A 9060
Lageplan 0104 DAT 517f 2005 A 9060 Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |
| Exemplar 1 | Nicht ausleihbar Am Standort |