The Complexity Theory Companion:
The Complexity Theory Companion is an accessible, algorithmically oriented, research-centered, up-to-date guide to some of the most interesting techniques of complexity theory. The book's thesis is that simple algorithms are at the heart of complexity theory. From the tree-pruning and interval-...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin, Heidelberg
Springer Berlin Heidelberg
2002
|
| Ausgabe: | 1st ed. 2002 |
| Schriftenreihe: | Texts in Theoretical Computer Science. An EATCS Series
|
| Schlagworte: | |
| Online-Zugang: | UBY01 Volltext |
| Zusammenfassung: | The Complexity Theory Companion is an accessible, algorithmically oriented, research-centered, up-to-date guide to some of the most interesting techniques of complexity theory. The book's thesis is that simple algorithms are at the heart of complexity theory. From the tree-pruning and interval-pruning algorithms that shape the first chapter to the query simulation procedures that dominate the last chapter, the central proof methods of the book are algorithmic. And to more clearly highlight the role of algorithmic techniques in complexity theory, the book is - unlike other texts on complexity - organized by technique rather than by topic. Each chapter of this book focuses on one technique: what it is, and what results and applications it yields. This textbook was developed at the University of Rochester in courses given to graduate students and advanced undergraduates. Researchers also will find this book a valuable source of reference due to the comprehensive bibliography of close to five hundred entries, the thirty-five page subject index, and the appendices giving overviews of complexity classes and reductions |
| Beschreibung: | 1 Online-Ressource (XIII, 372 p) |
| ISBN: | 9783662048801 |
| DOI: | 10.1007/978-3-662-04880-1 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV047063954 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 201216s2002 |||| o||u| ||||||eng d | ||
| 020 | |a 9783662048801 |9 978-3-662-04880-1 | ||
| 024 | 7 | |a 10.1007/978-3-662-04880-1 |2 doi | |
| 035 | |a (ZDB-2-SCS)978-3-662-04880-1 | ||
| 035 | |a (OCoLC)1227481998 | ||
| 035 | |a (DE-599)BVBBV047063954 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 082 | 0 | |a 005.11 |2 23 | |
| 084 | |a CM 2500 |0 (DE-625)18944: |2 rvk | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 100 | 1 | |a Hemaspaandra, Lane A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The Complexity Theory Companion |c by Lane A. Hemaspaandra, Mitsunori Ogihara |
| 250 | |a 1st ed. 2002 | ||
| 264 | 1 | |a Berlin, Heidelberg |b Springer Berlin Heidelberg |c 2002 | |
| 300 | |a 1 Online-Ressource (XIII, 372 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Texts in Theoretical Computer Science. An EATCS Series | |
| 520 | |a The Complexity Theory Companion is an accessible, algorithmically oriented, research-centered, up-to-date guide to some of the most interesting techniques of complexity theory. The book's thesis is that simple algorithms are at the heart of complexity theory. From the tree-pruning and interval-pruning algorithms that shape the first chapter to the query simulation procedures that dominate the last chapter, the central proof methods of the book are algorithmic. And to more clearly highlight the role of algorithmic techniques in complexity theory, the book is - unlike other texts on complexity - organized by technique rather than by topic. Each chapter of this book focuses on one technique: what it is, and what results and applications it yields. This textbook was developed at the University of Rochester in courses given to graduate students and advanced undergraduates. Researchers also will find this book a valuable source of reference due to the comprehensive bibliography of close to five hundred entries, the thirty-five page subject index, and the appendices giving overviews of complexity classes and reductions | ||
| 650 | 4 | |a Programming Techniques | |
| 650 | 4 | |a Algorithm Analysis and Problem Complexity | |
| 650 | 4 | |a Combinatorics | |
| 650 | 4 | |a Data Structures and Information Theory | |
| 650 | 4 | |a Math Applications in Computer Science | |
| 650 | 4 | |a Discrete Mathematics in Computer Science | |
| 650 | 4 | |a Computer programming | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Combinatorics | |
| 650 | 4 | |a Data structures (Computer science) | |
| 650 | 4 | |a Computer science—Mathematics | |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Ogihara, Mitsunori |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783642086847 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783540674191 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783662048818 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-662-04880-1 |x Verlag |z URL des Eerstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-SCS | ||
| 940 | 1 | |q ZDB-2-SCS_2000/2004 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032471066 | ||
| 966 | e | |u https://doi.org/10.1007/978-3-662-04880-1 |l UBY01 |p ZDB-2-SCS |q ZDB-2-SCS_2000/2004 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804182061356941312 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Hemaspaandra, Lane A. Ogihara, Mitsunori |
| author_facet | Hemaspaandra, Lane A. Ogihara, Mitsunori |
| author_role | aut aut |
| author_sort | Hemaspaandra, Lane A. |
| author_variant | l a h la lah m o mo |
| building | Verbundindex |
| bvnumber | BV047063954 |
| classification_rvk | CM 2500 ST 130 ST 134 |
| collection | ZDB-2-SCS |
| ctrlnum | (ZDB-2-SCS)978-3-662-04880-1 (OCoLC)1227481998 (DE-599)BVBBV047063954 |
| dewey-full | 005.11 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.11 |
| dewey-search | 005.11 |
| dewey-sort | 15.11 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Psychologie |
| discipline_str_mv | Informatik Psychologie |
| doi_str_mv | 10.1007/978-3-662-04880-1 |
| edition | 1st ed. 2002 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03447nmm a2200625zc 4500</leader><controlfield tag="001">BV047063954</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">201216s2002 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783662048801</subfield><subfield code="9">978-3-662-04880-1</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-662-04880-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-3-662-04880-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1227481998</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047063954</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-706</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.11</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">CM 2500</subfield><subfield code="0">(DE-625)18944:</subfield><subfield code="2">rvk</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="100" ind1="1" ind2=" "><subfield code="a">Hemaspaandra, Lane A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The Complexity Theory Companion</subfield><subfield code="c">by Lane A. Hemaspaandra, Mitsunori Ogihara</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2002</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin, Heidelberg</subfield><subfield code="b">Springer Berlin Heidelberg</subfield><subfield code="c">2002</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XIII, 372 p)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Texts in Theoretical Computer Science. An EATCS Series</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The Complexity Theory Companion is an accessible, algorithmically oriented, research-centered, up-to-date guide to some of the most interesting techniques of complexity theory. The book's thesis is that simple algorithms are at the heart of complexity theory. From the tree-pruning and interval-pruning algorithms that shape the first chapter to the query simulation procedures that dominate the last chapter, the central proof methods of the book are algorithmic. And to more clearly highlight the role of algorithmic techniques in complexity theory, the book is - unlike other texts on complexity - organized by technique rather than by topic. Each chapter of this book focuses on one technique: what it is, and what results and applications it yields. This textbook was developed at the University of Rochester in courses given to graduate students and advanced undergraduates. Researchers also will find this book a valuable source of reference due to the comprehensive bibliography of close to five hundred entries, the thirty-five page subject index, and the appendices giving overviews of complexity classes and reductions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming Techniques</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm Analysis and Problem Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data Structures and Information Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Math Applications in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete Mathematics in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science—Mathematics</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="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="700" ind1="1" ind2=" "><subfield code="a">Ogihara, Mitsunori</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783642086847</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783540674191</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783662048818</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-662-04880-1</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Eerstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2000/2004</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032471066</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-662-04880-1</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">ZDB-2-SCS_2000/2004</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV047063954 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T16:12:21Z |
| indexdate | 2024-07-10T09:01:33Z |
| institution | BVB |
| isbn | 9783662048801 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032471066 |
| oclc_num | 1227481998 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 1 Online-Ressource (XIII, 372 p) |
| psigel | ZDB-2-SCS ZDB-2-SCS_2000/2004 ZDB-2-SCS ZDB-2-SCS_2000/2004 |
| publishDate | 2002 |
| publishDateSearch | 2002 |
| publishDateSort | 2002 |
| publisher | Springer Berlin Heidelberg |
| record_format | marc |
| series2 | Texts in Theoretical Computer Science. An EATCS Series |
| spelling | Hemaspaandra, Lane A. Verfasser aut The Complexity Theory Companion by Lane A. Hemaspaandra, Mitsunori Ogihara 1st ed. 2002 Berlin, Heidelberg Springer Berlin Heidelberg 2002 1 Online-Ressource (XIII, 372 p) txt rdacontent c rdamedia cr rdacarrier Texts in Theoretical Computer Science. An EATCS Series The Complexity Theory Companion is an accessible, algorithmically oriented, research-centered, up-to-date guide to some of the most interesting techniques of complexity theory. The book's thesis is that simple algorithms are at the heart of complexity theory. From the tree-pruning and interval-pruning algorithms that shape the first chapter to the query simulation procedures that dominate the last chapter, the central proof methods of the book are algorithmic. And to more clearly highlight the role of algorithmic techniques in complexity theory, the book is - unlike other texts on complexity - organized by technique rather than by topic. Each chapter of this book focuses on one technique: what it is, and what results and applications it yields. This textbook was developed at the University of Rochester in courses given to graduate students and advanced undergraduates. Researchers also will find this book a valuable source of reference due to the comprehensive bibliography of close to five hundred entries, the thirty-five page subject index, and the appendices giving overviews of complexity classes and reductions Programming Techniques Algorithm Analysis and Problem Complexity Combinatorics Data Structures and Information Theory Math Applications in Computer Science Discrete Mathematics in Computer Science Computer programming Algorithms Data structures (Computer science) Computer science—Mathematics Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 s DE-604 Ogihara, Mitsunori aut Erscheint auch als Druck-Ausgabe 9783642086847 Erscheint auch als Druck-Ausgabe 9783540674191 Erscheint auch als Druck-Ausgabe 9783662048818 https://doi.org/10.1007/978-3-662-04880-1 Verlag URL des Eerstveröffentlichers Volltext |
| spellingShingle | Hemaspaandra, Lane A. Ogihara, Mitsunori The Complexity Theory Companion Programming Techniques Algorithm Analysis and Problem Complexity Combinatorics Data Structures and Information Theory Math Applications in Computer Science Discrete Mathematics in Computer Science Computer programming Algorithms Data structures (Computer science) Computer science—Mathematics Komplexitätstheorie (DE-588)4120591-1 gnd |
| subject_GND | (DE-588)4120591-1 |
| title | The Complexity Theory Companion |
| title_auth | The Complexity Theory Companion |
| title_exact_search | The Complexity Theory Companion |
| title_exact_search_txtP | The Complexity Theory Companion |
| title_full | The Complexity Theory Companion by Lane A. Hemaspaandra, Mitsunori Ogihara |
| title_fullStr | The Complexity Theory Companion by Lane A. Hemaspaandra, Mitsunori Ogihara |
| title_full_unstemmed | The Complexity Theory Companion by Lane A. Hemaspaandra, Mitsunori Ogihara |
| title_short | The Complexity Theory Companion |
| title_sort | the complexity theory companion |
| topic | Programming Techniques Algorithm Analysis and Problem Complexity Combinatorics Data Structures and Information Theory Math Applications in Computer Science Discrete Mathematics in Computer Science Computer programming Algorithms Data structures (Computer science) Computer science—Mathematics Komplexitätstheorie (DE-588)4120591-1 gnd |
| topic_facet | Programming Techniques Algorithm Analysis and Problem Complexity Combinatorics Data Structures and Information Theory Math Applications in Computer Science Discrete Mathematics in Computer Science Computer programming Algorithms Data structures (Computer science) Computer science—Mathematics Komplexitätstheorie |
| url | https://doi.org/10.1007/978-3-662-04880-1 |
| work_keys_str_mv | AT hemaspaandralanea thecomplexitytheorycompanion AT ogiharamitsunori thecomplexitytheorycompanion |