Theory of computational complexity:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
New York
Wiley
©2000
|
| Schriftenreihe: | Wiley-Interscience series in discrete mathematics and optimization
|
| Schlagworte: | |
| Online-Zugang: | FRO01 UBG01 Volltext |
| Beschreibung: | Includes bibliographical references (pages 453-473) and index "Complexity theory studies the inherent difficulties of solving algorithmic problems by digital computers. This comprehensive work discusses the major topics in complexity theory, including fundamental topics as well as recent breakthroughs not previously available in book form."--Jacket |
| Beschreibung: | 1 Online-Ressource (xiii, 491 pages) |
| ISBN: | 9781118031162 1118031164 9781118032916 1118032918 0471345067 9780471345060 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043394282 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 160222s2000 |||| o||u| ||||||eng d | ||
| 020 | |a 9781118031162 |c electronic bk. |9 978-1-118-03116-2 | ||
| 020 | |a 1118031164 |c electronic bk. |9 1-118-03116-4 | ||
| 020 | |a 9781118032916 |c electronic bk. |9 978-1-118-03291-6 | ||
| 020 | |a 1118032918 |c electronic bk. |9 1-118-03291-8 | ||
| 020 | |a 0471345067 |9 0-471-34506-7 | ||
| 020 | |a 9780471345060 |9 978-0-471-34506-0 | ||
| 024 | 7 | |a 10.1002/9781118032916 |2 doi | |
| 035 | |a (ZDB-35-WIC)ocn778448868 | ||
| 035 | |a (OCoLC)778448868 | ||
| 035 | |a (DE-599)BVBBV043394282 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-861 | ||
| 082 | 0 | |a 511.3 |2 22 | |
| 100 | 1 | |a Du, Dingzhu |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Theory of computational complexity |c Ding-Zhu Du, Ker-I Ko |
| 264 | 1 | |a New York |b Wiley |c ©2000 | |
| 300 | |a 1 Online-Ressource (xiii, 491 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Wiley-Interscience series in discrete mathematics and optimization | |
| 500 | |a Includes bibliographical references (pages 453-473) and index | ||
| 500 | |a "Complexity theory studies the inherent difficulties of solving algorithmic problems by digital computers. This comprehensive work discusses the major topics in complexity theory, including fundamental topics as well as recent breakthroughs not previously available in book form."--Jacket | ||
| 650 | 7 | |a MATHEMATICS / Infinity |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS / Logic |2 bisacsh | |
| 650 | 7 | |a Computational complexity |2 fast | |
| 650 | 7 | |a Computabilidade e complexidade |2 larpcal | |
| 650 | 7 | |a Berechnungskomplexität |2 swd | |
| 650 | 4 | |a Computational complexity | |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Ko, Ker-I. |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u https://onlinelibrary.wiley.com/doi/book/10.1002/9781118032916 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-35-WIC | ||
| 940 | 1 | |q UBG_PDA_WIC | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-028812865 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://onlinelibrary.wiley.com/doi/book/10.1002/9781118032916 |l FRO01 |p ZDB-35-WIC |q FRO_PDA_WIC |x Verlag |3 Volltext | |
| 966 | e | |u https://onlinelibrary.wiley.com/doi/book/10.1002/9781118032916 |l UBG01 |p ZDB-35-WIC |q UBG_PDA_WIC |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804175972678762496 |
|---|---|
| any_adam_object | |
| author | Du, Dingzhu |
| author_facet | Du, Dingzhu |
| author_role | aut |
| author_sort | Du, Dingzhu |
| author_variant | d d dd |
| building | Verbundindex |
| bvnumber | BV043394282 |
| collection | ZDB-35-WIC |
| ctrlnum | (ZDB-35-WIC)ocn778448868 (OCoLC)778448868 (DE-599)BVBBV043394282 |
| dewey-full | 511.3 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3 |
| dewey-search | 511.3 |
| dewey-sort | 3511.3 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02610nmm a2200577zc 4500</leader><controlfield tag="001">BV043394282</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">160222s2000 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781118031162</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-1-118-03116-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1118031164</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">1-118-03116-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781118032916</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-1-118-03291-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1118032918</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">1-118-03291-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0471345067</subfield><subfield code="9">0-471-34506-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780471345060</subfield><subfield code="9">978-0-471-34506-0</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1002/9781118032916</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-35-WIC)ocn778448868</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)778448868</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043394282</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-861</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Du, Dingzhu</subfield><subfield code="e">Verfasser</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, Ker-I Ko</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York</subfield><subfield code="b">Wiley</subfield><subfield code="c">©2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xiii, 491 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">Wiley-Interscience series in discrete mathematics and optimization</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (pages 453-473) and index</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">"Complexity theory studies the inherent difficulties of solving algorithmic problems by digital computers. This comprehensive work discusses the major topics in complexity theory, including fundamental topics as well as recent breakthroughs not previously available in book form."--Jacket</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Infinity</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Logic</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="7"><subfield code="a">Computabilidade e complexidade</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="2">swd</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">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-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="700" ind1="1" ind2=" "><subfield code="a">Ko, Ker-I.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://onlinelibrary.wiley.com/doi/book/10.1002/9781118032916</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-35-WIC</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">UBG_PDA_WIC</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028812865</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><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://onlinelibrary.wiley.com/doi/book/10.1002/9781118032916</subfield><subfield code="l">FRO01</subfield><subfield code="p">ZDB-35-WIC</subfield><subfield code="q">FRO_PDA_WIC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://onlinelibrary.wiley.com/doi/book/10.1002/9781118032916</subfield><subfield code="l">UBG01</subfield><subfield code="p">ZDB-35-WIC</subfield><subfield code="q">UBG_PDA_WIC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043394282 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:24:47Z |
| institution | BVB |
| isbn | 9781118031162 1118031164 9781118032916 1118032918 0471345067 9780471345060 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028812865 |
| oclc_num | 778448868 |
| open_access_boolean | |
| owner | DE-861 |
| owner_facet | DE-861 |
| physical | 1 Online-Ressource (xiii, 491 pages) |
| psigel | ZDB-35-WIC UBG_PDA_WIC ZDB-35-WIC FRO_PDA_WIC ZDB-35-WIC UBG_PDA_WIC |
| publishDate | 2000 |
| publishDateSearch | 2000 |
| publishDateSort | 2000 |
| publisher | Wiley |
| record_format | marc |
| series2 | Wiley-Interscience series in discrete mathematics and optimization |
| spelling | Du, Dingzhu Verfasser aut Theory of computational complexity Ding-Zhu Du, Ker-I Ko New York Wiley ©2000 1 Online-Ressource (xiii, 491 pages) txt rdacontent c rdamedia cr rdacarrier Wiley-Interscience series in discrete mathematics and optimization Includes bibliographical references (pages 453-473) and index "Complexity theory studies the inherent difficulties of solving algorithmic problems by digital computers. This comprehensive work discusses the major topics in complexity theory, including fundamental topics as well as recent breakthroughs not previously available in book form."--Jacket MATHEMATICS / Infinity bisacsh MATHEMATICS / Logic bisacsh Computational complexity fast Computabilidade e complexidade larpcal Berechnungskomplexität swd Computational complexity Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 s 1\p DE-604 Ko, Ker-I. Sonstige oth https://onlinelibrary.wiley.com/doi/book/10.1002/9781118032916 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Du, Dingzhu Theory of computational complexity MATHEMATICS / Infinity bisacsh MATHEMATICS / Logic bisacsh Computational complexity fast Computabilidade e complexidade larpcal Berechnungskomplexität swd Computational complexity Berechnungskomplexität (DE-588)4134751-1 gnd |
| subject_GND | (DE-588)4134751-1 |
| 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, Ker-I Ko |
| title_fullStr | Theory of computational complexity Ding-Zhu Du, Ker-I Ko |
| title_full_unstemmed | Theory of computational complexity Ding-Zhu Du, Ker-I Ko |
| title_short | Theory of computational complexity |
| title_sort | theory of computational complexity |
| topic | MATHEMATICS / Infinity bisacsh MATHEMATICS / Logic bisacsh Computational complexity fast Computabilidade e complexidade larpcal Berechnungskomplexität swd Computational complexity Berechnungskomplexität (DE-588)4134751-1 gnd |
| topic_facet | MATHEMATICS / Infinity MATHEMATICS / Logic Computational complexity Computabilidade e complexidade Berechnungskomplexität |
| url | https://onlinelibrary.wiley.com/doi/book/10.1002/9781118032916 |
| work_keys_str_mv | AT dudingzhu theoryofcomputationalcomplexity AT kokeri theoryofcomputationalcomplexity |