Theory of computational complexity:
Praise for the First Edition "" ... complete, up-to-date coverage of computational complexity theory ... the book promises to become the standard reference on computational complexity.""--Zentralblatt MATH A thorough revision based on advances in the field of computational comple...
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Hoboken, New Jersey
John Wiley & Sons
2014
|
| Ausgabe: | Second edition. |
| Schlagwörter: | |
| Links: | https://learning.oreilly.com/library/view/-/9781118594971/?ar |
| Zusammenfassung: | Praise for the First Edition "" ... complete, up-to-date coverage of computational complexity theory ... the book promises to become the standard reference on computational complexity.""--Zentralblatt MATH A thorough revision based on advances in the field of computational complexity and readers' feedback, the Second Edition of Theory of Computational Complexity presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the use of |
| Beschreibung: | Includes bibliographical references and index. - Print version record and CIP data provided by publisher |
| Umfang: | 1 online resource |
| ISBN: | 9781118594971 1118594975 9781118593035 1118593030 9781118032916 1118032918 9781118595091 1118595092 |
Internformat
MARC
| LEADER | 00000cam a22000002c 4500 | ||
|---|---|---|---|
| 001 | ZDB-30-ORH-047538511 | ||
| 003 | DE-627-1 | ||
| 005 | 20240228115416.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 191023s2014 xx |||||o 00| ||eng c | ||
| 020 | |a 9781118594971 |c epub |9 978-1-118-59497-1 | ||
| 020 | |a 1118594975 |c epub |9 1-118-59497-5 | ||
| 020 | |a 9781118593035 |c pdf |9 978-1-118-59303-5 | ||
| 020 | |a 1118593030 |c pdf |9 1-118-59303-0 | ||
| 020 | |a 9781118032916 |c online |9 978-1-118-03291-6 | ||
| 020 | |a 1118032918 |c online |9 1-118-03291-8 | ||
| 020 | |a 9781118595091 |9 978-1-118-59509-1 | ||
| 020 | |a 1118595092 |9 1-118-59509-2 | ||
| 035 | |a (DE-627-1)047538511 | ||
| 035 | |a (DE-599)KEP047538511 | ||
| 035 | |a (ORHE)9781118594971 | ||
| 035 | |a (DE-627-1)047538511 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rda | ||
| 041 | |a eng | ||
| 072 | 7 | |a MAT |2 bisacsh | |
| 082 | 0 | |a 511.3/52 |2 23 | |
| 100 | 1 | |a Du, Dingzhu |e VerfasserIn |4 aut | |
| 245 | 1 | 0 | |a Theory of computational complexity |c Ding-Zhu Du, Department of Computer Science, University of Texas at Dallas, Ann Arbor, MI, Ker-I Ko, Department of Computer Science, State University of New York at Stony Brook, Stony Brook, NY |
| 250 | |a Second edition. | ||
| 264 | 1 | |a Hoboken, New Jersey |b John Wiley & Sons |c 2014 | |
| 300 | |a 1 online resource | ||
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a Includes bibliographical references and index. - Print version record and CIP data provided by publisher | ||
| 520 | |a Praise for the First Edition "" ... complete, up-to-date coverage of computational complexity theory ... the book promises to become the standard reference on computational complexity.""--Zentralblatt MATH A thorough revision based on advances in the field of computational complexity and readers' feedback, the Second Edition of Theory of Computational Complexity presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the use of | ||
| 650 | 0 | |a Computational complexity | |
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 4 | |a MATHEMATICS ; General | |
| 650 | 4 | |a Computational complexity | |
| 700 | 1 | |a Ko, Ker-I |e VerfasserIn |4 aut | |
| 776 | 1 | |z 9781118306086 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781118306086 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-30-ORH |q TUM_PDA_ORH |u https://learning.oreilly.com/library/view/-/9781118594971/?ar |m X:ORHE |x Aggregator |z lizenzpflichtig |3 Volltext |
| 912 | |a ZDB-30-ORH | ||
| 912 | |a ZDB-30-ORH | ||
| 951 | |a BO | ||
| 912 | |a ZDB-30-ORH | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-30-ORH-047538511 |
|---|---|
| _version_ | 1833357091089154048 |
| adam_text | |
| any_adam_object | |
| author | Du, Dingzhu Ko, Ker-I |
| author_facet | Du, Dingzhu Ko, Ker-I |
| author_role | aut aut |
| author_sort | Du, Dingzhu |
| author_variant | d d dd k i k kik |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-30-ORH |
| ctrlnum | (DE-627-1)047538511 (DE-599)KEP047538511 (ORHE)9781118594971 |
| dewey-full | 511.3/52 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3/52 |
| dewey-search | 511.3/52 |
| dewey-sort | 3511.3 252 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| edition | Second edition. |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02593cam a22005292c 4500</leader><controlfield tag="001">ZDB-30-ORH-047538511</controlfield><controlfield tag="003">DE-627-1</controlfield><controlfield tag="005">20240228115416.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">191023s2014 xx |||||o 00| ||eng c</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781118594971</subfield><subfield code="c">epub</subfield><subfield code="9">978-1-118-59497-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1118594975</subfield><subfield code="c">epub</subfield><subfield code="9">1-118-59497-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781118593035</subfield><subfield code="c">pdf</subfield><subfield code="9">978-1-118-59303-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1118593030</subfield><subfield code="c">pdf</subfield><subfield code="9">1-118-59303-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781118032916</subfield><subfield code="c">online</subfield><subfield code="9">978-1-118-03291-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1118032918</subfield><subfield code="c">online</subfield><subfield code="9">1-118-03291-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781118595091</subfield><subfield code="9">978-1-118-59509-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1118595092</subfield><subfield code="9">1-118-59509-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627-1)047538511</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KEP047538511</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ORHE)9781118594971</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627-1)047538511</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3/52</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Du, Dingzhu</subfield><subfield code="e">VerfasserIn</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Theory of computational complexity</subfield><subfield code="c">Ding-Zhu Du, Department of Computer Science, University of Texas at Dallas, Ann Arbor, MI, Ker-I Ko, Department of Computer Science, State University of New York at Stony Brook, Stony Brook, NY</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Second edition.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hoboken, New Jersey</subfield><subfield code="b">John Wiley & Sons</subfield><subfield code="c">2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index. - Print version record and CIP data provided by publisher</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Praise for the First Edition "" ... complete, up-to-date coverage of computational complexity theory ... the book promises to become the standard reference on computational complexity.""--Zentralblatt MATH A thorough revision based on advances in the field of computational complexity and readers' feedback, the Second Edition of Theory of Computational Complexity presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the use of</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">MATHEMATICS ; General</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ko, Ker-I</subfield><subfield code="e">VerfasserIn</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="1" ind2=" "><subfield code="z">9781118306086</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">9781118306086</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-30-ORH</subfield><subfield code="q">TUM_PDA_ORH</subfield><subfield code="u">https://learning.oreilly.com/library/view/-/9781118594971/?ar</subfield><subfield code="m">X:ORHE</subfield><subfield code="x">Aggregator</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-ORH</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-ORH</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">BO</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-ORH</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-30-ORH-047538511 |
| illustrated | Not Illustrated |
| indexdate | 2025-05-28T09:46:10Z |
| institution | BVB |
| isbn | 9781118594971 1118594975 9781118593035 1118593030 9781118032916 1118032918 9781118595091 1118595092 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 online resource |
| psigel | ZDB-30-ORH TUM_PDA_ORH ZDB-30-ORH |
| publishDate | 2014 |
| publishDateSearch | 2014 |
| publishDateSort | 2014 |
| publisher | John Wiley & Sons |
| record_format | marc |
| spelling | Du, Dingzhu VerfasserIn aut Theory of computational complexity Ding-Zhu Du, Department of Computer Science, University of Texas at Dallas, Ann Arbor, MI, Ker-I Ko, Department of Computer Science, State University of New York at Stony Brook, Stony Brook, NY Second edition. Hoboken, New Jersey John Wiley & Sons 2014 1 online resource Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Includes bibliographical references and index. - Print version record and CIP data provided by publisher Praise for the First Edition "" ... complete, up-to-date coverage of computational complexity theory ... the book promises to become the standard reference on computational complexity.""--Zentralblatt MATH A thorough revision based on advances in the field of computational complexity and readers' feedback, the Second Edition of Theory of Computational Complexity presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the use of Computational complexity Complexité de calcul (Informatique) MATHEMATICS ; General Ko, Ker-I VerfasserIn aut 9781118306086 Erscheint auch als Druck-Ausgabe 9781118306086 |
| spellingShingle | Du, Dingzhu Ko, Ker-I Theory of computational complexity Computational complexity Complexité de calcul (Informatique) MATHEMATICS ; General |
| title | Theory of computational complexity |
| title_auth | Theory of computational complexity |
| title_exact_search | Theory of computational complexity |
| title_full | Theory of computational complexity Ding-Zhu Du, Department of Computer Science, University of Texas at Dallas, Ann Arbor, MI, Ker-I Ko, Department of Computer Science, State University of New York at Stony Brook, Stony Brook, NY |
| title_fullStr | Theory of computational complexity Ding-Zhu Du, Department of Computer Science, University of Texas at Dallas, Ann Arbor, MI, Ker-I Ko, Department of Computer Science, State University of New York at Stony Brook, Stony Brook, NY |
| title_full_unstemmed | Theory of computational complexity Ding-Zhu Du, Department of Computer Science, University of Texas at Dallas, Ann Arbor, MI, Ker-I Ko, Department of Computer Science, State University of New York at Stony Brook, Stony Brook, NY |
| title_short | Theory of computational complexity |
| title_sort | theory of computational complexity |
| topic | Computational complexity Complexité de calcul (Informatique) MATHEMATICS ; General |
| topic_facet | Computational complexity Complexité de calcul (Informatique) MATHEMATICS ; General |
| work_keys_str_mv | AT dudingzhu theoryofcomputationalcomplexity AT kokeri theoryofcomputationalcomplexity |