Super recursive algorithms:
Gespeichert in:
| Format: | Elektronisch E-Book |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
New York, NY
Springer
2005
|
| Schriftenreihe: | Monographs in computer science
|
| Schlagworte: | |
| Online-Zugang: | BTU01 FHM01 UBG01 UBY01 UPA01 Volltext |
| Beschreibung: | 1 Online-Ressource (XII, 304 S.) graph. Darst. |
| ISBN: | 0387955690 9780387268064 9780387955698 |
| DOI: | 10.1007/b138114 |
Internformat
MARC
| LEADER | 00000nmm a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV022480114 | ||
| 003 | DE-604 | ||
| 005 | 20070809 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 070626s2005 |||| o||u| ||||||eng d | ||
| 020 | |a 0387955690 |9 0-387-95569-0 | ||
| 020 | |a 9780387268064 |c Online |9 978-0-387-26806-4 | ||
| 020 | |a 9780387955698 |9 978-0-387-95569-8 | ||
| 024 | 7 | |a 10.1007/b138114 |2 doi | |
| 035 | |a (OCoLC)836532516 | ||
| 035 | |a (DE-599)BVBBV022480114 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-473 |a DE-739 |a DE-706 |a DE-M347 |a DE-634 | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a DAT 530f |2 stub | ||
| 245 | 1 | 0 | |a Super recursive algorithms |c Mark Burgin |
| 246 | 1 | 3 | |a Super-recursive algorithms |
| 264 | 1 | |a New York, NY |b Springer |c 2005 | |
| 300 | |a 1 Online-Ressource (XII, 304 S.) |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Monographs in computer science | |
| 650 | 0 | 7 | |a Rekursiver Algorithmus |0 (DE-588)4502357-8 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Rekursiver Algorithmus |0 (DE-588)4502357-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Burgin, Mark S. |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/b138114 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SCS | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015687478 | ||
| 966 | e | |u https://doi.org/10.1007/b138114 |l BTU01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/b138114 |l FHM01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/b138114 |l UBG01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/b138114 |l UBY01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/b138114 |l UPA01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804136570907787264 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| building | Verbundindex |
| bvnumber | BV022480114 |
| classification_rvk | ST 130 ST 134 |
| classification_tum | DAT 530f |
| collection | ZDB-2-SCS |
| ctrlnum | (OCoLC)836532516 (DE-599)BVBBV022480114 |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| doi_str_mv | 10.1007/b138114 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01782nmm a2200469 c 4500</leader><controlfield tag="001">BV022480114</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20070809 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">070626s2005 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387955690</subfield><subfield code="9">0-387-95569-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780387268064</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-387-26806-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780387955698</subfield><subfield code="9">978-0-387-95569-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/b138114</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)836532516</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV022480114</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-473</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-634</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="084" ind1=" " ind2=" "><subfield code="a">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Super recursive algorithms</subfield><subfield code="c">Mark Burgin</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Super-recursive algorithms</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">Springer</subfield><subfield code="c">2005</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XII, 304 S.)</subfield><subfield code="b">graph. Darst.</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">Monographs in computer science</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Rekursiver Algorithmus</subfield><subfield code="0">(DE-588)4502357-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Rekursiver Algorithmus</subfield><subfield code="0">(DE-588)4502357-8</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">Burgin, Mark S.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/b138114</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015687478</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/b138114</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/b138114</subfield><subfield code="l">FHM01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/b138114</subfield><subfield code="l">UBG01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/b138114</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/b138114</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV022480114 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T17:47:57Z |
| indexdate | 2024-07-09T20:58:30Z |
| institution | BVB |
| isbn | 0387955690 9780387268064 9780387955698 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015687478 |
| oclc_num | 836532516 |
| open_access_boolean | |
| owner | DE-473 DE-BY-UBG DE-739 DE-706 DE-M347 DE-634 |
| owner_facet | DE-473 DE-BY-UBG DE-739 DE-706 DE-M347 DE-634 |
| physical | 1 Online-Ressource (XII, 304 S.) graph. Darst. |
| psigel | ZDB-2-SCS |
| publishDate | 2005 |
| publishDateSearch | 2005 |
| publishDateSort | 2005 |
| publisher | Springer |
| record_format | marc |
| series2 | Monographs in computer science |
| spelling | Super recursive algorithms Mark Burgin Super-recursive algorithms New York, NY Springer 2005 1 Online-Ressource (XII, 304 S.) graph. Darst. txt rdacontent c rdamedia cr rdacarrier Monographs in computer science Rekursiver Algorithmus (DE-588)4502357-8 gnd rswk-swf Rekursiver Algorithmus (DE-588)4502357-8 s DE-604 Burgin, Mark S. Sonstige oth https://doi.org/10.1007/b138114 Verlag Volltext |
| spellingShingle | Super recursive algorithms Rekursiver Algorithmus (DE-588)4502357-8 gnd |
| subject_GND | (DE-588)4502357-8 |
| title | Super recursive algorithms |
| title_alt | Super-recursive algorithms |
| title_auth | Super recursive algorithms |
| title_exact_search | Super recursive algorithms |
| title_exact_search_txtP | Super recursive algorithms |
| title_full | Super recursive algorithms Mark Burgin |
| title_fullStr | Super recursive algorithms Mark Burgin |
| title_full_unstemmed | Super recursive algorithms Mark Burgin |
| title_short | Super recursive algorithms |
| title_sort | super recursive algorithms |
| topic | Rekursiver Algorithmus (DE-588)4502357-8 gnd |
| topic_facet | Rekursiver Algorithmus |
| url | https://doi.org/10.1007/b138114 |
| work_keys_str_mv | AT burginmarks superrecursivealgorithms |