Algorithms:
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boston [u.a.]
McGraw-Hill
2008
|
| Ausgabe: | 1. ed. |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | X, 320 S. Ill., graph. Darst. |
| ISBN: | 0073523402 9780073523408 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV022422468 | ||
| 003 | DE-604 | ||
| 005 | 20240416 | ||
| 007 | t | ||
| 008 | 070511s2008 ad|| |||| 00||| eng d | ||
| 020 | |a 0073523402 |9 0-07-352340-2 | ||
| 020 | |a 9780073523408 |9 978-0-07-352340-8 | ||
| 035 | |a (OCoLC)70267221 | ||
| 035 | |a (DE-599)BVBBV022422468 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-92 |a DE-703 |a DE-20 |a DE-384 |a DE-634 |a DE-83 |a DE-11 |a DE-473 | ||
| 050 | 0 | |a QA9.58 | |
| 082 | 0 | |a 518/.1 |2 22 | |
| 084 | |a QH 500 |0 (DE-625)141607: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 100 | 1 | |a Dasgupta, Sanjoy |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Algorithms |c Sanjoy Dasgupta ; Christos Papadimitriou ; Umesh Vazirani |
| 250 | |a 1. ed. | ||
| 264 | 1 | |a Boston [u.a.] |b McGraw-Hill |c 2008 | |
| 300 | |a X, 320 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 7 | |a Algoritmos e estruturas de dados |2 larpcal | |
| 650 | 4 | |a Algorithms |v Textbooks | |
| 650 | 4 | |a Computer algorithms |v Textbooks | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4123623-3 |a Lehrbuch |2 gnd-content | |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Papadimitriou, Christos H. |d 1949- |e Verfasser |0 (DE-588)135731909 |4 aut | |
| 700 | 1 | |a Vazirani, Umesh Virkumar |e Verfasser |0 (DE-588)136197337 |4 aut | |
| 856 | 4 | 2 | |m Digitalisierung UB Augsburg |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015630767&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015630767 | ||
Datensatz im Suchindex
| _version_ | 1804136492137709568 |
|---|---|
| adam_text | Contents
Preface
ix
0
Prologue
1
0.1
Books and algorithms
1
0.2
Enter Fibonacci
2
0.3 Big
-О
notation
6
Exercises
8
1
Algorithms with numbers
11
1.1
Basic arithmetic
11
1.2
Modular arithmetic
16
1.3
Primality testing
23
1.4
Cryptography
30
1.5
Universal hashing
35
Exercises
38
Randomized algorithms: a virtual chapter
29
2
Divide-and-conquer algorithms
45
2.1
Multiplication
45
2.2
Recurrence relations
49
2.3
Mergesort
50
2.4
Medians
53
2.5
Matrix multiplication
56
2.6
The fast Fourier transform
58
Exercises
70
3
Decompositions of graphs
80
3.1
Why graphs?
80
3.2
Depth-first search in undirected graphs
, 83
3.3
Depth-first search in directed graphs
87
3.4
Strongly connected components
91
Exercises
9 5
4
Paths in graphs
104
4.1
Distances
104
4.2
Breadth-first search
105
v
Vi
Contents
4.3
Lengths on edges
107
4.4
Dijkstra s
algorithm
108
4.5
Priority queue implementations
113
4.6
Shortest paths in the presence of negative edges
115
4.7
Shortest paths in dags
119
Exercises
120
Greedy algorithms
127
5.1
Minimum spanning trees
127
5.2
Huffman encoding
138
5.3
Horn formulas
144
5.4
Set cover
145
Exercises
148
Dynamic programming
156
6.1
Shortest paths in dags, revisited
156
6.2
Longest increasing subsequences
157
6.3
Edit distance
159
6.4
Knapsack
164
6.5
Chain matrix multiplication
168
6.6
Shortest paths
171
6.7
Independent sets in trees
175
Exercises
177
Linear programming and reductions
188
7.1
An introduction to linear programming
188
7.2
Flows in networks
198
7.3
Bipartite matching
205
7.4
Duality
206
7.5
Zero-sum games
209
7.6
The simplex algorithm
213
7.7
Postscript: circuit evaluation
221
Exercises
222
NP-compIete problems
232
8.1
Search problems
232
8.2
NP-complete problems
243
8.3
The reductions
247
Exercises
264
Coping with NP-completeness
271
9.1
Intelligent exhaustive search
272
9.2
Approximation algorithms
276
9.3
Local search heuristics
285
Exercises
293
Contents
vil
10 Quantum
algorithms
297
10.1 Qubits,
superposition, and measurement
297
10.2
The plan
301
10.3
The quantum Fourier transform
303
10.4
Periodicity
305
10.5
Quantum circuits
307
10.6
Factoring as periodicity
310
10.7
The quantum algorithm for factoring
311
Exercises
314
Historical notes and further reading
317
Index
319
|
| adam_txt |
Contents
Preface
ix
0
Prologue
1
0.1
Books and algorithms
1
0.2
Enter Fibonacci
2
0.3 Big
-О
notation
6
Exercises
8
1
Algorithms with numbers
11
1.1
Basic arithmetic
11
1.2
Modular arithmetic
16
1.3
Primality testing
23
1.4
Cryptography
30
1.5
Universal hashing
35
Exercises
38
Randomized algorithms: a virtual chapter
29
2
Divide-and-conquer algorithms
45
2.1
Multiplication
45
2.2
Recurrence relations
49
2.3
Mergesort
50
2.4
Medians
53
2.5
Matrix multiplication
56
2.6
The fast Fourier transform
58
Exercises
70
3
Decompositions of graphs
80
3.1
Why graphs?
80
3.2
Depth-first search in undirected graphs
, 83
3.3
Depth-first search in directed graphs
87
3.4
Strongly connected components
91
Exercises
9 5
4
Paths in graphs
104
4.1
Distances
104
4.2
Breadth-first search
105
v
Vi
Contents
4.3
Lengths on edges
107
4.4
Dijkstra's
algorithm
108
4.5
Priority queue implementations
113
4.6
Shortest paths in the presence of negative edges
115
4.7
Shortest paths in dags
119
Exercises
120
Greedy algorithms
127
5.1
Minimum spanning trees
127
5.2
Huffman encoding
138
5.3
Horn formulas
144
5.4
Set cover
145
Exercises
148
Dynamic programming
156
6.1
Shortest paths in dags, revisited
156
6.2
Longest increasing subsequences
157
6.3
Edit distance
159
6.4
Knapsack
164
6.5
Chain matrix multiplication
168
6.6
Shortest paths
171
6.7
Independent sets in trees
175
Exercises
177
Linear programming and reductions
188
7.1
An introduction to linear programming
188
7.2
Flows in networks
198
7.3
Bipartite matching
205
7.4
Duality
206
7.5
Zero-sum games
209
7.6
The simplex algorithm
213
7.7
Postscript: circuit evaluation
221
Exercises
222
NP-compIete problems
232
8.1
Search problems
232
8.2
NP-complete problems
243
8.3
The reductions
247
Exercises
264
Coping with NP-completeness
271
9.1
Intelligent exhaustive search
272
9.2
Approximation algorithms
276
9.3
Local search heuristics
285
Exercises
293
Contents
vil
10 Quantum
algorithms
297
10.1 Qubits,
superposition, and measurement
297
10.2
The plan
301
10.3
The quantum Fourier transform
303
10.4
Periodicity
305
10.5
Quantum circuits
307
10.6
Factoring as periodicity
310
10.7
The quantum algorithm for factoring
311
Exercises
314
Historical notes and further reading
317
Index
319 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Dasgupta, Sanjoy Papadimitriou, Christos H. 1949- Vazirani, Umesh Virkumar |
| author_GND | (DE-588)135731909 (DE-588)136197337 |
| author_facet | Dasgupta, Sanjoy Papadimitriou, Christos H. 1949- Vazirani, Umesh Virkumar |
| author_role | aut aut aut |
| author_sort | Dasgupta, Sanjoy |
| author_variant | s d sd c h p ch chp u v v uv uvv |
| building | Verbundindex |
| bvnumber | BV022422468 |
| 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 | QH 500 ST 134 |
| ctrlnum | (OCoLC)70267221 (DE-599)BVBBV022422468 |
| 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 11 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik Wirtschaftswissenschaften |
| discipline_str_mv | Informatik Mathematik Wirtschaftswissenschaften |
| edition | 1. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01745nam a2200445 c 4500</leader><controlfield tag="001">BV022422468</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240416 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">070511s2008 ad|| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0073523402</subfield><subfield code="9">0-07-352340-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780073523408</subfield><subfield code="9">978-0-07-352340-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)70267221</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV022422468</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-92</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-473</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><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 500</subfield><subfield code="0">(DE-625)141607:</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="100" ind1="1" ind2=" "><subfield code="a">Dasgupta, Sanjoy</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms</subfield><subfield code="c">Sanjoy Dasgupta ; Christos Papadimitriou ; Umesh Vazirani</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston [u.a.]</subfield><subfield code="b">McGraw-Hill</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 320 S.</subfield><subfield code="b">Ill., 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="7"><subfield code="a">Algoritmos e estruturas de dados</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield><subfield code="v">Textbooks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield><subfield code="v">Textbooks</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="655" ind1=" " ind2="7"><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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Papadimitriou, Christos H.</subfield><subfield code="d">1949-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)135731909</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vazirani, Umesh Virkumar</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)136197337</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Augsburg</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=015630767&sequence=000002&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-015630767</subfield></datafield></record></collection> |
| genre | (DE-588)4123623-3 Lehrbuch gnd-content |
| genre_facet | Lehrbuch |
| id | DE-604.BV022422468 |
| illustrated | Illustrated |
| index_date | 2024-07-02T17:26:11Z |
| indexdate | 2024-07-09T20:57:15Z |
| institution | BVB |
| isbn | 0073523402 9780073523408 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015630767 |
| oclc_num | 70267221 |
| open_access_boolean | |
| owner | DE-92 DE-703 DE-20 DE-384 DE-634 DE-83 DE-11 DE-473 DE-BY-UBG |
| owner_facet | DE-92 DE-703 DE-20 DE-384 DE-634 DE-83 DE-11 DE-473 DE-BY-UBG |
| physical | X, 320 S. Ill., graph. Darst. |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | McGraw-Hill |
| record_format | marc |
| spelling | Dasgupta, Sanjoy Verfasser aut Algorithms Sanjoy Dasgupta ; Christos Papadimitriou ; Umesh Vazirani 1. ed. Boston [u.a.] McGraw-Hill 2008 X, 320 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Algoritmos e estruturas de dados larpcal Algorithms Textbooks Computer algorithms Textbooks Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)4123623-3 Lehrbuch gnd-content Algorithmus (DE-588)4001183-5 s DE-604 Papadimitriou, Christos H. 1949- Verfasser (DE-588)135731909 aut Vazirani, Umesh Virkumar Verfasser (DE-588)136197337 aut Digitalisierung UB Augsburg application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015630767&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Dasgupta, Sanjoy Papadimitriou, Christos H. 1949- Vazirani, Umesh Virkumar Algorithms Algoritmos e estruturas de dados larpcal Algorithms Textbooks Computer algorithms Textbooks Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4123623-3 |
| title | Algorithms |
| title_auth | Algorithms |
| title_exact_search | Algorithms |
| title_exact_search_txtP | Algorithms |
| title_full | Algorithms Sanjoy Dasgupta ; Christos Papadimitriou ; Umesh Vazirani |
| title_fullStr | Algorithms Sanjoy Dasgupta ; Christos Papadimitriou ; Umesh Vazirani |
| title_full_unstemmed | Algorithms Sanjoy Dasgupta ; Christos Papadimitriou ; Umesh Vazirani |
| title_short | Algorithms |
| title_sort | algorithms |
| topic | Algoritmos e estruturas de dados larpcal Algorithms Textbooks Computer algorithms Textbooks Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Algoritmos e estruturas de dados Algorithms Textbooks Computer algorithms Textbooks Algorithmus Lehrbuch |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015630767&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT dasguptasanjoy algorithms AT papadimitriouchristosh algorithms AT vaziraniumeshvirkumar algorithms |