Design and analysis of randomized algorithms: introduction to design paradigms
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2005
|
| Schriftenreihe: | Texts in theoretical computer science
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Literaturverz. S. 267 - 269 |
| Beschreibung: | XII, 274 S. graph. Darst. 24 cm |
| ISBN: | 9783540239499 3540239499 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV020867465 | ||
| 003 | DE-604 | ||
| 005 | 20211109 | ||
| 007 | t | ||
| 008 | 051114s2005 gw d||| |||| 00||| eng d | ||
| 015 | |a 05,N01,0041 |2 dnb | ||
| 015 | |a 05,A31,0027 |2 dnb | ||
| 016 | 7 | |a 973030178 |2 DE-101 | |
| 020 | |a 9783540239499 |c Pp. : ca. EUR 42.75 (freier Pr.), ca. sfr 73.00 (freier Pr.) |9 978-3-540-23949-9 | ||
| 020 | |a 3540239499 |c Pp. : ca. EUR 42.75 (freier Pr.), ca. sfr 73.00 (freier Pr.) |9 3-540-23949-9 | ||
| 024 | 3 | |a 9783540239499 | |
| 028 | 5 | 2 | |a 11361282 |
| 035 | |a (OCoLC)254194858 | ||
| 035 | |a (DE-599)BVBBV020867465 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 049 | |a DE-91G |a DE-11 |a DE-739 | ||
| 050 | 0 | |a QA274 | |
| 082 | 0 | |a 519.2/3 |2 22 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a MAT 606f |2 stub | ||
| 084 | |a 004 |2 sdnb | ||
| 084 | |a DAT 537f |2 stub | ||
| 084 | |a 510 |2 sdnb | ||
| 100 | 1 | |a Hromkovič, Juraj |d 1958- |e Verfasser |0 (DE-588)123212898 |4 aut | |
| 245 | 1 | 0 | |a Design and analysis of randomized algorithms |b introduction to design paradigms |c J. Hromkovič |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2005 | |
| 300 | |a XII, 274 S. |b graph. Darst. |c 24 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Texts in theoretical computer science | |
| 500 | |a Literaturverz. S. 267 - 269 | ||
| 650 | 4 | |a Algorithmes | |
| 650 | 7 | |a Analyse (wiskunde) |2 gtt | |
| 650 | 4 | |a Processus stochastiques | |
| 650 | 7 | |a Random walks (statistiek) |2 gtt | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Stochastic processes | |
| 650 | 0 | 7 | |a Randomisierter Algorithmus |0 (DE-588)4176929-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Randomisierter Algorithmus |0 (DE-588)4176929-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m Digitalisierung UB Passau - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014189267&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-014189267 | ||
Datensatz im Suchindex
| _version_ | 1804134591471026176 |
|---|---|
| adam_text | Contents 1 Introduction........................................................................................... 1 1.1 What Is Randomness and Does There Exist True Randomness? ....................................................................... 1 1.2 Randomness as a Source of Efficiency an Exemplary Application........................................................... 5 1.3 Concept of the Book..................................................................... 11 1.4 To the Student.............................................................................. 14 1.5 To the Teacher.............................................................................. 16 2 Fundamentals.......................................................................................... 19 2.1 2.2 2.3 2.4 2.5 Objectives...................................................................................... Elementary Probability Theory................................................... Models of Randomized Algorithms.............................................. Classification of Randomized Algorithms.................................. Classification of Randomized Algorithms for Optimization Problems........................................................... 2.6 Paradigms of the Design of Randomized Algorithms............... 2.7 Summary........................................................................................ 3 72 87 96 Foiling the Adversary........................................................................... 101 3.1 3.2 3.3 3.4 3.5 3.6 4 19 20 37 51
Objectives....................................................................................... 101 Hashing........................................................................................... 102 Universal Hashing..........................................................................109 Online Algorithms..........................................................................116 Randomized Online Algorithms...................................................120 Summary......................................................................................... 128 Fingerprinting.........................................................................................131 4.1 Objectives....................................................................................... 131 4.2 Communication Protocols.............................................................133 4.3 The Substring Problem.................................................................. 139
XII Contents 4.4 Verification of Matrix Multiplication........................................... 141 4.5 Equivalence of Two Polynomials................................................... 144 4.6 Summary......................................................................................... 149 5 Success Amplification and RandomSampling............................153 5.1 Objectives....................................................................................... 153 5.2 Efficient Amplification by Repeating Critical Computation Parts...........................................................154 5.3 Repeated Random Sampling and Satisfiability............................ 166 5.4 Random Sampling and Generating Quadratic Nonresidues .... 174 5.5 Summary......................................................................................... 181 6 Abundance of Witnesses.................................................................. 183 6.1 Objectives....................................................................................... 183 6.2 Searching for Witnesses for PrimalityTesting............................. 184 6.3 Solovay-Strassen Algorithm for Primality Testing...................... 192 6.4 Generation of Random Primes..................................................... 202 6.5 Summary......................................................................................... 206 7 Optimization and Random Rounding..........................................209 7.1 Objectives....................................................................................... 209
7.2 Relaxation to Linear Programming............................................. 210 7.3 Random Rounding and MAX-SAT............................................... 216 7.4 Combining Random Sampling and RandomRounding................ 222 7.5 Summary........................................................................ 225 A Fundamentals of Mathematics........................................................227 A.l Objectives...................................................................................... 227 A.2 Algebra and Number Theory....................................................... 228 A.3 Combinatorics ...............................................................................256 A.4 Summary........................................................................................ 264 References................................................................................................... 267 Index 271
|
| adam_txt |
Contents 1 Introduction. 1 1.1 What Is Randomness and Does There Exist True Randomness? . 1 1.2 Randomness as a Source of Efficiency an Exemplary Application. 5 1.3 Concept of the Book. 11 1.4 To the Student. 14 1.5 To the Teacher. 16 2 Fundamentals. 19 2.1 2.2 2.3 2.4 2.5 Objectives. Elementary Probability Theory. Models of Randomized Algorithms. Classification of Randomized Algorithms. Classification of Randomized Algorithms for Optimization Problems. 2.6 Paradigms of the Design of Randomized Algorithms. 2.7 Summary. 3 72 87 96 Foiling the Adversary. 101 3.1 3.2 3.3 3.4 3.5 3.6 4 19 20 37 51
Objectives. 101 Hashing. 102 Universal Hashing.109 Online Algorithms.116 Randomized Online Algorithms.120 Summary. 128 Fingerprinting.131 4.1 Objectives. 131 4.2 Communication Protocols.133 4.3 The Substring Problem. 139
XII Contents 4.4 Verification of Matrix Multiplication. 141 4.5 Equivalence of Two Polynomials. 144 4.6 Summary. 149 5 Success Amplification and RandomSampling.153 5.1 Objectives. 153 5.2 Efficient Amplification by Repeating Critical Computation Parts.154 5.3 Repeated Random Sampling and Satisfiability. 166 5.4 Random Sampling and Generating Quadratic Nonresidues . 174 5.5 Summary. 181 6 Abundance of Witnesses. 183 6.1 Objectives. 183 6.2 Searching for Witnesses for PrimalityTesting. 184 6.3 Solovay-Strassen Algorithm for Primality Testing. 192 6.4 Generation of Random Primes. 202 6.5 Summary. 206 7 Optimization and Random Rounding.209 7.1 Objectives. 209
7.2 Relaxation to Linear Programming. 210 7.3 Random Rounding and MAX-SAT. 216 7.4 Combining Random Sampling and RandomRounding. 222 7.5 Summary. 225 A Fundamentals of Mathematics.227 A.l Objectives. 227 A.2 Algebra and Number Theory. 228 A.3 Combinatorics .256 A.4 Summary. 264 References. 267 Index 271 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Hromkovič, Juraj 1958- |
| author_GND | (DE-588)123212898 |
| author_facet | Hromkovič, Juraj 1958- |
| author_role | aut |
| author_sort | Hromkovič, Juraj 1958- |
| author_variant | j h jh |
| building | Verbundindex |
| bvnumber | BV020867465 |
| callnumber-first | Q - Science |
| callnumber-label | QA274 |
| callnumber-raw | QA274 |
| callnumber-search | QA274 |
| callnumber-sort | QA 3274 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 134 |
| classification_tum | MAT 606f DAT 537f |
| ctrlnum | (OCoLC)254194858 (DE-599)BVBBV020867465 |
| dewey-full | 519.2/3 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.2/3 |
| dewey-search | 519.2/3 |
| dewey-sort | 3519.2 13 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02127nam a2200565 c 4500</leader><controlfield tag="001">BV020867465</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20211109 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">051114s2005 gw d||| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">05,N01,0041</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">05,A31,0027</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">973030178</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783540239499</subfield><subfield code="c">Pp. : ca. EUR 42.75 (freier Pr.), ca. sfr 73.00 (freier Pr.)</subfield><subfield code="9">978-3-540-23949-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540239499</subfield><subfield code="c">Pp. : ca. EUR 42.75 (freier Pr.), ca. sfr 73.00 (freier Pr.)</subfield><subfield code="9">3-540-23949-9</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783540239499</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">11361282</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)254194858</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV020867465</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">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA274</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.2/3</subfield><subfield code="2">22</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">MAT 606f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 537f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hromkovič, Juraj</subfield><subfield code="d">1958-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)123212898</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Design and analysis of randomized algorithms</subfield><subfield code="b">introduction to design paradigms</subfield><subfield code="c">J. Hromkovič</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">XII, 274 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">24 cm</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">Texts in theoretical computer science</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 267 - 269</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Analyse (wiskunde)</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Processus stochastiques</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Random walks (statistiek)</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Stochastic processes</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Randomisierter Algorithmus</subfield><subfield code="0">(DE-588)4176929-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Randomisierter Algorithmus</subfield><subfield code="0">(DE-588)4176929-6</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="2"><subfield code="m">Digitalisierung UB Passau - 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=014189267&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-014189267</subfield></datafield></record></collection> |
| id | DE-604.BV020867465 |
| illustrated | Illustrated |
| index_date | 2024-07-02T13:24:53Z |
| indexdate | 2024-07-09T20:27:03Z |
| institution | BVB |
| isbn | 9783540239499 3540239499 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-014189267 |
| oclc_num | 254194858 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-11 DE-739 |
| owner_facet | DE-91G DE-BY-TUM DE-11 DE-739 |
| physical | XII, 274 S. graph. Darst. 24 cm |
| publishDate | 2005 |
| publishDateSearch | 2005 |
| publishDateSort | 2005 |
| publisher | Springer |
| record_format | marc |
| series2 | Texts in theoretical computer science |
| spelling | Hromkovič, Juraj 1958- Verfasser (DE-588)123212898 aut Design and analysis of randomized algorithms introduction to design paradigms J. Hromkovič Berlin [u.a.] Springer 2005 XII, 274 S. graph. Darst. 24 cm txt rdacontent n rdamedia nc rdacarrier Texts in theoretical computer science Literaturverz. S. 267 - 269 Algorithmes Analyse (wiskunde) gtt Processus stochastiques Random walks (statistiek) gtt Algorithms Stochastic processes Randomisierter Algorithmus (DE-588)4176929-6 gnd rswk-swf Randomisierter Algorithmus (DE-588)4176929-6 s DE-604 Digitalisierung UB Passau - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014189267&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Hromkovič, Juraj 1958- Design and analysis of randomized algorithms introduction to design paradigms Algorithmes Analyse (wiskunde) gtt Processus stochastiques Random walks (statistiek) gtt Algorithms Stochastic processes Randomisierter Algorithmus (DE-588)4176929-6 gnd |
| subject_GND | (DE-588)4176929-6 |
| title | Design and analysis of randomized algorithms introduction to design paradigms |
| title_auth | Design and analysis of randomized algorithms introduction to design paradigms |
| title_exact_search | Design and analysis of randomized algorithms introduction to design paradigms |
| title_exact_search_txtP | Design and analysis of randomized algorithms introduction to design paradigms |
| title_full | Design and analysis of randomized algorithms introduction to design paradigms J. Hromkovič |
| title_fullStr | Design and analysis of randomized algorithms introduction to design paradigms J. Hromkovič |
| title_full_unstemmed | Design and analysis of randomized algorithms introduction to design paradigms J. Hromkovič |
| title_short | Design and analysis of randomized algorithms |
| title_sort | design and analysis of randomized algorithms introduction to design paradigms |
| title_sub | introduction to design paradigms |
| topic | Algorithmes Analyse (wiskunde) gtt Processus stochastiques Random walks (statistiek) gtt Algorithms Stochastic processes Randomisierter Algorithmus (DE-588)4176929-6 gnd |
| topic_facet | Algorithmes Analyse (wiskunde) Processus stochastiques Random walks (statistiek) Algorithms Stochastic processes Randomisierter Algorithmus |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014189267&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT hromkovicjuraj designandanalysisofrandomizedalgorithmsintroductiontodesignparadigms |