Computational complexity: a quantitative perspective
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
Elsevier
2004
|
| Ausgabe: | 1st ed |
| Schriftenreihe: | North-Holland mathematics studies
196 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | Includes bibliographical references (pages 321-332) and index There has been a common perception that computational complexity is a theory of "bad news" because its most typical results assert that various real-world and innocent-looking tasks are infeasible. In fact, "bad news" is a relative term, and, indeed, in some situations (e.g., in cryptography), we want an adversary to not be able to perform a certain task. However, a "bad news" result does not automatically become useful in such a scenario. For this to happen, its hardness features have to be quantitatively evaluated and shown to manifest extensively. The book undertakes a quantitative analysis of some of the major results in complexity that regard either classes of problems or individual concrete problems. The size of some important classes are studied using resource-bounded topological and measure-theoretical tools. In the case of individual problems, the book studies relevant quantitative attributes such as approximation properties or the number of hard inputs at each length. One chapter is dedicated to abstract complexity theory, an older field which, however, deserves attention because it lays out the foundations of complexity. The other chapters, on the other hand, focus on recent and important developments in complexity. The book presents in a fairly detailed manner concepts that have been at the centre of the main research lines in complexity in the last decade or so, such as: average-complexity, quantum computation, hardness amplification, resource-bounded measure, the relation between one-way functions and pseudo-random generators, the relation between hard predicates and pseudo-random generators, extractors, derandomization of bounded-error probabilistic algorithms, probabilistically checkable proofs, non-approximability of optimization problems, and others. The book should appeal to graduate computer science students, and to researchers who have an interest in computer science theory and need a good understanding of computational complexity, e.g., researchers in algorithms, AI, logic, and other disciplines. Emphasis is on relevant quantitative attributes of important results in complexity. Coverage is self-contained and accessible to a wide audience. Large range of important topics including: derandomization techniques, non-approximability of optimization problems, average-case complexity, quantum computation, one-way functions and pseudo-random generators, resource-bounded measure and topology |
| Beschreibung: | 1 Online-Ressource (xii, 340 pages) |
| ISBN: | 1423709357 9781423709350 9780444828415 0444828419 008047666X 9780080476667 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042317220 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150129s2004 |||| o||u| ||||||eng d | ||
| 020 | |a 1423709357 |c electronic bk. |9 1-4237-0935-7 | ||
| 020 | |a 9781423709350 |c electronic bk. |9 978-1-4237-0935-0 | ||
| 020 | |a 9780444828415 |9 978-0-444-82841-5 | ||
| 020 | |a 0444828419 |9 0-444-82841-9 | ||
| 020 | |a 008047666X |c electronic bk. |9 0-08-047666-X | ||
| 020 | |a 9780080476667 |c electronic bk. |9 978-0-08-047666-7 | ||
| 035 | |a (ZDB-33-EBS)ocm60747122 | ||
| 035 | |a (OCoLC)60747122 | ||
| 035 | |a (DE-599)BVBBV042317220 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1046 | ||
| 082 | 0 | |a 511.352 |2 22 | |
| 100 | 1 | |a Zimand, Marius |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Computational complexity |b a quantitative perspective |c Marius Zimand |
| 250 | |a 1st ed | ||
| 264 | 1 | |a Amsterdam |b Elsevier |c 2004 | |
| 300 | |a 1 Online-Ressource (xii, 340 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a North-Holland mathematics studies |v 196 | |
| 500 | |a Includes bibliographical references (pages 321-332) and index | ||
| 500 | |a There has been a common perception that computational complexity is a theory of "bad news" because its most typical results assert that various real-world and innocent-looking tasks are infeasible. In fact, "bad news" is a relative term, and, indeed, in some situations (e.g., in cryptography), we want an adversary to not be able to perform a certain task. However, a "bad news" result does not automatically become useful in such a scenario. For this to happen, its hardness features have to be quantitatively evaluated and shown to manifest extensively. The book undertakes a quantitative analysis of some of the major results in complexity that regard either classes of problems or individual concrete problems. The size of some important classes are studied using resource-bounded topological and measure-theoretical tools. In the case of individual problems, the book studies relevant quantitative attributes such as approximation properties or the number of hard inputs at each length. | ||
| 500 | |a One chapter is dedicated to abstract complexity theory, an older field which, however, deserves attention because it lays out the foundations of complexity. The other chapters, on the other hand, focus on recent and important developments in complexity. The book presents in a fairly detailed manner concepts that have been at the centre of the main research lines in complexity in the last decade or so, such as: average-complexity, quantum computation, hardness amplification, resource-bounded measure, the relation between one-way functions and pseudo-random generators, the relation between hard predicates and pseudo-random generators, extractors, derandomization of bounded-error probabilistic algorithms, probabilistically checkable proofs, non-approximability of optimization problems, and others. | ||
| 500 | |a The book should appeal to graduate computer science students, and to researchers who have an interest in computer science theory and need a good understanding of computational complexity, e.g., researchers in algorithms, AI, logic, and other disciplines. Emphasis is on relevant quantitative attributes of important results in complexity. Coverage is self-contained and accessible to a wide audience. Large range of important topics including: derandomization techniques, non-approximability of optimization problems, average-case complexity, quantum computation, one-way functions and pseudo-random generators, resource-bounded measure and topology | ||
| 650 | 7 | |a COMPUTERS / Machine Theory |2 bisacsh | |
| 650 | 7 | |a Computational complexity |2 fast | |
| 650 | 4 | |a Computational complexity | |
| 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 | |8 1\p |5 DE-604 | |
| 856 | 4 | 0 | |u http://www.sciencedirect.com/science/book/9780444828415 |x Verlag |3 Volltext |
| 912 | |a ZDB-33-ESD |a ZDB-33-EBS | ||
| 940 | 1 | |q FAW_PDA_ESD | |
| 940 | 1 | |q FLA_PDA_ESD | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027754211 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804152913419829248 |
|---|---|
| any_adam_object | |
| author | Zimand, Marius |
| author_facet | Zimand, Marius |
| author_role | aut |
| author_sort | Zimand, Marius |
| author_variant | m z mz |
| building | Verbundindex |
| bvnumber | BV042317220 |
| collection | ZDB-33-ESD ZDB-33-EBS |
| ctrlnum | (ZDB-33-EBS)ocm60747122 (OCoLC)60747122 (DE-599)BVBBV042317220 |
| dewey-full | 511.352 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.352 |
| dewey-search | 511.352 |
| dewey-sort | 3511.352 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| edition | 1st ed |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04325nmm a2200541zcb4500</leader><controlfield tag="001">BV042317220</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150129s2004 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1423709357</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">1-4237-0935-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781423709350</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-1-4237-0935-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780444828415</subfield><subfield code="9">978-0-444-82841-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0444828419</subfield><subfield code="9">0-444-82841-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">008047666X</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">0-08-047666-X</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780080476667</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-0-08-047666-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-33-EBS)ocm60747122</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)60747122</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042317220</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-1046</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.352</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zimand, Marius</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computational complexity</subfield><subfield code="b">a quantitative perspective</subfield><subfield code="c">Marius Zimand</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="b">Elsevier</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xii, 340 pages)</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">North-Holland mathematics studies</subfield><subfield code="v">196</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (pages 321-332) and index</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">There has been a common perception that computational complexity is a theory of "bad news" because its most typical results assert that various real-world and innocent-looking tasks are infeasible. In fact, "bad news" is a relative term, and, indeed, in some situations (e.g., in cryptography), we want an adversary to not be able to perform a certain task. However, a "bad news" result does not automatically become useful in such a scenario. For this to happen, its hardness features have to be quantitatively evaluated and shown to manifest extensively. The book undertakes a quantitative analysis of some of the major results in complexity that regard either classes of problems or individual concrete problems. The size of some important classes are studied using resource-bounded topological and measure-theoretical tools. In the case of individual problems, the book studies relevant quantitative attributes such as approximation properties or the number of hard inputs at each length. </subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">One chapter is dedicated to abstract complexity theory, an older field which, however, deserves attention because it lays out the foundations of complexity. The other chapters, on the other hand, focus on recent and important developments in complexity. The book presents in a fairly detailed manner concepts that have been at the centre of the main research lines in complexity in the last decade or so, such as: average-complexity, quantum computation, hardness amplification, resource-bounded measure, the relation between one-way functions and pseudo-random generators, the relation between hard predicates and pseudo-random generators, extractors, derandomization of bounded-error probabilistic algorithms, probabilistically checkable proofs, non-approximability of optimization problems, and others. </subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">The book should appeal to graduate computer science students, and to researchers who have an interest in computer science theory and need a good understanding of computational complexity, e.g., researchers in algorithms, AI, logic, and other disciplines. Emphasis is on relevant quantitative attributes of important results in complexity. Coverage is self-contained and accessible to a wide audience. Large range of important topics including: derandomization techniques, non-approximability of optimization problems, average-case complexity, quantum computation, one-way functions and pseudo-random generators, resource-bounded measure and topology</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Machine Theory</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computational complexity</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</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="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.sciencedirect.com/science/book/9780444828415</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-33-ESD</subfield><subfield code="a">ZDB-33-EBS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">FAW_PDA_ESD</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">FLA_PDA_ESD</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027754211</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></record></collection> |
| id | DE-604.BV042317220 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:18:16Z |
| institution | BVB |
| isbn | 1423709357 9781423709350 9780444828415 0444828419 008047666X 9780080476667 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027754211 |
| oclc_num | 60747122 |
| open_access_boolean | |
| owner | DE-1046 |
| owner_facet | DE-1046 |
| physical | 1 Online-Ressource (xii, 340 pages) |
| psigel | ZDB-33-ESD ZDB-33-EBS FAW_PDA_ESD FLA_PDA_ESD |
| publishDate | 2004 |
| publishDateSearch | 2004 |
| publishDateSort | 2004 |
| publisher | Elsevier |
| record_format | marc |
| series2 | North-Holland mathematics studies |
| spelling | Zimand, Marius Verfasser aut Computational complexity a quantitative perspective Marius Zimand 1st ed Amsterdam Elsevier 2004 1 Online-Ressource (xii, 340 pages) txt rdacontent c rdamedia cr rdacarrier North-Holland mathematics studies 196 Includes bibliographical references (pages 321-332) and index There has been a common perception that computational complexity is a theory of "bad news" because its most typical results assert that various real-world and innocent-looking tasks are infeasible. In fact, "bad news" is a relative term, and, indeed, in some situations (e.g., in cryptography), we want an adversary to not be able to perform a certain task. However, a "bad news" result does not automatically become useful in such a scenario. For this to happen, its hardness features have to be quantitatively evaluated and shown to manifest extensively. The book undertakes a quantitative analysis of some of the major results in complexity that regard either classes of problems or individual concrete problems. The size of some important classes are studied using resource-bounded topological and measure-theoretical tools. In the case of individual problems, the book studies relevant quantitative attributes such as approximation properties or the number of hard inputs at each length. One chapter is dedicated to abstract complexity theory, an older field which, however, deserves attention because it lays out the foundations of complexity. The other chapters, on the other hand, focus on recent and important developments in complexity. The book presents in a fairly detailed manner concepts that have been at the centre of the main research lines in complexity in the last decade or so, such as: average-complexity, quantum computation, hardness amplification, resource-bounded measure, the relation between one-way functions and pseudo-random generators, the relation between hard predicates and pseudo-random generators, extractors, derandomization of bounded-error probabilistic algorithms, probabilistically checkable proofs, non-approximability of optimization problems, and others. The book should appeal to graduate computer science students, and to researchers who have an interest in computer science theory and need a good understanding of computational complexity, e.g., researchers in algorithms, AI, logic, and other disciplines. Emphasis is on relevant quantitative attributes of important results in complexity. Coverage is self-contained and accessible to a wide audience. Large range of important topics including: derandomization techniques, non-approximability of optimization problems, average-case complexity, quantum computation, one-way functions and pseudo-random generators, resource-bounded measure and topology COMPUTERS / Machine Theory bisacsh Computational complexity fast Computational complexity Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 s 1\p DE-604 http://www.sciencedirect.com/science/book/9780444828415 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Zimand, Marius Computational complexity a quantitative perspective COMPUTERS / Machine Theory bisacsh Computational complexity fast Computational complexity Komplexitätstheorie (DE-588)4120591-1 gnd |
| subject_GND | (DE-588)4120591-1 |
| title | Computational complexity a quantitative perspective |
| title_auth | Computational complexity a quantitative perspective |
| title_exact_search | Computational complexity a quantitative perspective |
| title_full | Computational complexity a quantitative perspective Marius Zimand |
| title_fullStr | Computational complexity a quantitative perspective Marius Zimand |
| title_full_unstemmed | Computational complexity a quantitative perspective Marius Zimand |
| title_short | Computational complexity |
| title_sort | computational complexity a quantitative perspective |
| title_sub | a quantitative perspective |
| topic | COMPUTERS / Machine Theory bisacsh Computational complexity fast Computational complexity Komplexitätstheorie (DE-588)4120591-1 gnd |
| topic_facet | COMPUTERS / Machine Theory Computational complexity Komplexitätstheorie |
| url | http://www.sciencedirect.com/science/book/9780444828415 |
| work_keys_str_mv | AT zimandmarius computationalcomplexityaquantitativeperspective |