Complexity and approximation: in memory of Ker-I Ko
Gespeichert in:
Weitere Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Cham
Springer
[2020]
|
Schriftenreihe: | Lecture notes in computer science
12000 |
Schlagworte: | |
Beschreibung: | Auf dem Umschlag: "Festschrift" |
Beschreibung: | x, 288 Seiten Diagramme |
ISBN: | 9783030416713 |
Internformat
MARC
LEADER | 00000nam a2200000zcb4500 | ||
---|---|---|---|
001 | BV046622548 | ||
003 | DE-604 | ||
007 | t| | ||
008 | 200310s2020 xx |||| |||| 01||| eng d | ||
020 | |a 9783030416713 |9 978-3-030-41671-3 | ||
035 | |a (OCoLC)1145218365 | ||
035 | |a (DE-599)BVBBV046622548 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-83 | ||
082 | 0 | |a 005.1 |2 23 | |
245 | 1 | 0 | |a Complexity and approximation |b in memory of Ker-I Ko |c Ding-Zhu Du, Jie Wang (eds.) |
264 | 1 | |a Cham |b Springer |c [2020] | |
300 | |a x, 288 Seiten |b Diagramme | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Lecture notes in computer science |v 12000 | |
500 | |a Auf dem Umschlag: "Festschrift" | ||
650 | 4 | |a Algorithm Analysis and Problem Complexity | |
650 | 4 | |a Mathematics of Algorithmic Complexity | |
650 | 4 | |a Algorithms | |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)4016928-5 |a Festschrift |2 gnd-content | |
689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | |8 1\p |5 DE-604 | |
700 | 1 | |a Du, Dingzhu |d 1948- |0 (DE-588)1013682580 |4 edt | |
700 | 1 | |a Ko, Ker-I |d 1950-2018 |0 (DE-588)171476034 |4 hnr | |
776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-3-030-41672-0 |
830 | 0 | |a Lecture notes in computer science |v 12000 |w (DE-604)BV000000607 |9 12000 | |
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-032034241 |
Datensatz im Suchindex
_version_ | 1820875764855209984 |
---|---|
adam_text | |
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author2 | Du, Dingzhu 1948- |
author2_role | edt |
author2_variant | d d dd |
author_GND | (DE-588)1013682580 (DE-588)171476034 |
author_facet | Du, Dingzhu 1948- |
building | Verbundindex |
bvnumber | BV046622548 |
classification_rvk | SS 4800 |
ctrlnum | (OCoLC)1145218365 (DE-599)BVBBV046622548 |
dewey-full | 005.1 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 005 - Computer programming, programs, data, security |
dewey-raw | 005.1 |
dewey-search | 005.1 |
dewey-sort | 15.1 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik |
discipline_str_mv | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zcb4500</leader><controlfield tag="001">BV046622548</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">200310s2020 xx |||| |||| 01||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783030416713</subfield><subfield code="9">978-3-030-41671-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1145218365</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046622548</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">23</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Complexity and approximation</subfield><subfield code="b">in memory of Ker-I Ko</subfield><subfield code="c">Ding-Zhu Du, Jie Wang (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham</subfield><subfield code="b">Springer</subfield><subfield code="c">[2020]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">x, 288 Seiten</subfield><subfield code="b">Diagramme</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="1" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">12000</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Auf dem Umschlag: "Festschrift"</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">Mathematics of Algorithmic Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4016928-5</subfield><subfield code="a">Festschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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">Du, Dingzhu</subfield><subfield code="d">1948-</subfield><subfield code="0">(DE-588)1013682580</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ko, Ker-I</subfield><subfield code="d">1950-2018</subfield><subfield code="0">(DE-588)171476034</subfield><subfield code="4">hnr</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-3-030-41672-0</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">12000</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">12000</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="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032034241</subfield></datafield></record></collection> |
genre | (DE-588)4016928-5 Festschrift gnd-content |
genre_facet | Festschrift |
id | DE-604.BV046622548 |
illustrated | Not Illustrated |
index_date | 2024-07-03T14:08:35Z |
indexdate | 2025-01-10T15:20:50Z |
institution | BVB |
isbn | 9783030416713 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032034241 |
oclc_num | 1145218365 |
open_access_boolean | |
owner | DE-83 |
owner_facet | DE-83 |
physical | x, 288 Seiten Diagramme |
publishDate | 2020 |
publishDateSearch | 2020 |
publishDateSort | 2020 |
publisher | Springer |
record_format | marc |
series | Lecture notes in computer science |
series2 | Lecture notes in computer science |
spelling | Complexity and approximation in memory of Ker-I Ko Ding-Zhu Du, Jie Wang (eds.) Cham Springer [2020] x, 288 Seiten Diagramme txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 12000 Auf dem Umschlag: "Festschrift" Algorithm Analysis and Problem Complexity Mathematics of Algorithmic Complexity Algorithms Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)4016928-5 Festschrift gnd-content Algorithmus (DE-588)4001183-5 s 1\p DE-604 Du, Dingzhu 1948- (DE-588)1013682580 edt Ko, Ker-I 1950-2018 (DE-588)171476034 hnr Erscheint auch als Online-Ausgabe 978-3-030-41672-0 Lecture notes in computer science 12000 (DE-604)BV000000607 12000 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Complexity and approximation in memory of Ker-I Ko Lecture notes in computer science Algorithm Analysis and Problem Complexity Mathematics of Algorithmic Complexity Algorithms Algorithmus (DE-588)4001183-5 gnd |
subject_GND | (DE-588)4001183-5 (DE-588)4016928-5 |
title | Complexity and approximation in memory of Ker-I Ko |
title_auth | Complexity and approximation in memory of Ker-I Ko |
title_exact_search | Complexity and approximation in memory of Ker-I Ko |
title_exact_search_txtP | Complexity and approximation in memory of Ker-I Ko |
title_full | Complexity and approximation in memory of Ker-I Ko Ding-Zhu Du, Jie Wang (eds.) |
title_fullStr | Complexity and approximation in memory of Ker-I Ko Ding-Zhu Du, Jie Wang (eds.) |
title_full_unstemmed | Complexity and approximation in memory of Ker-I Ko Ding-Zhu Du, Jie Wang (eds.) |
title_short | Complexity and approximation |
title_sort | complexity and approximation in memory of ker i ko |
title_sub | in memory of Ker-I Ko |
topic | Algorithm Analysis and Problem Complexity Mathematics of Algorithmic Complexity Algorithms Algorithmus (DE-588)4001183-5 gnd |
topic_facet | Algorithm Analysis and Problem Complexity Mathematics of Algorithmic Complexity Algorithms Algorithmus Festschrift |
volume_link | (DE-604)BV000000607 |
work_keys_str_mv | AT dudingzhu complexityandapproximationinmemoryofkeriko AT kokeri complexityandapproximationinmemoryofkeriko |