Computational Complexity of sequential and parallel algorithms:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
Chicester <<[u.a.]>>
Wiley
1987
|
| Ausgabe: | Repr. |
| Schriftenreihe: | Wiley series in computing
A Wiley-Interscience publication |
| Schlagworte: | |
| Beschreibung: | X, 224 S. graph. Darst. |
| ISBN: | 0471908142 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV024679171 | ||
| 003 | DE-604 | ||
| 005 | 20090910 | ||
| 007 | t | ||
| 008 | 090924s1987 d||| |||| 00||| und d | ||
| 020 | |a 0471908142 |9 0-471-90814-2 | ||
| 035 | |a (OCoLC)258653863 | ||
| 035 | |a (DE-599)BVBBV024679171 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | |a und | ||
| 049 | |a DE-83 | ||
| 082 | 0 | |a 001.642 | |
| 082 | 0 | |a 511'.8 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 100 | 1 | |a Kronsjö, Lydia I. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Computational Complexity of sequential and parallel algorithms |c Lydia Kronsjö |
| 250 | |a Repr. | ||
| 264 | 1 | |a Chicester <<[u.a.]>> |b Wiley |c 1987 | |
| 300 | |a X, 224 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Wiley series in computing | |
| 490 | 0 | |a A Wiley-Interscience publication | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexität |0 (DE-588)4135369-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Paralleler Algorithmus |0 (DE-588)4193615-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Komplexität |0 (DE-588)4135369-9 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | 1 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 689 | 2 | 0 | |a Paralleler Algorithmus |0 (DE-588)4193615-2 |D s |
| 689 | 2 | |8 2\p |5 DE-604 | |
| 940 | 1 | |q TUB-nve | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-018090125 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804140091927429120 |
|---|---|
| any_adam_object | |
| author | Kronsjö, Lydia I. |
| author_facet | Kronsjö, Lydia I. |
| author_role | aut |
| author_sort | Kronsjö, Lydia I. |
| author_variant | l i k li lik |
| building | Verbundindex |
| bvnumber | BV024679171 |
| classification_rvk | ST 130 |
| ctrlnum | (OCoLC)258653863 (DE-599)BVBBV024679171 |
| dewey-full | 001.642 511'.8 |
| dewey-hundreds | 000 - Computer science, information, general works 500 - Natural sciences and mathematics |
| dewey-ones | 001 - Knowledge 511 - General principles of mathematics |
| dewey-raw | 001.642 511'.8 |
| dewey-search | 001.642 511'.8 |
| dewey-sort | 11.642 |
| dewey-tens | 000 - Computer science, information, general works 510 - Mathematics |
| discipline | Allgemeines Informatik Mathematik |
| edition | Repr. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01757nam a2200505 c 4500</leader><controlfield tag="001">BV024679171</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090910 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090924s1987 d||| |||| 00||| und d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0471908142</subfield><subfield code="9">0-471-90814-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)258653863</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV024679171</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=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">001.642</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511'.8</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="100" ind1="1" ind2=" "><subfield code="a">Kronsjö, Lydia I.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computational Complexity of sequential and parallel algorithms</subfield><subfield code="c">Lydia Kronsjö</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Repr.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Chicester <<[u.a.]>></subfield><subfield code="b">Wiley</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 224 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">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="0" ind2=" "><subfield code="a">Wiley series in computing</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">A Wiley-Interscience publication</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="650" ind1="0" ind2="7"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Paralleler Algorithmus</subfield><subfield code="0">(DE-588)4193615-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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ät</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="1" ind2="1"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Paralleler Algorithmus</subfield><subfield code="0">(DE-588)4193615-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">TUB-nve</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-018090125</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="883" ind1="1" ind2=" "><subfield code="8">2\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.BV024679171 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T21:54:28Z |
| institution | BVB |
| isbn | 0471908142 |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-018090125 |
| oclc_num | 258653863 |
| open_access_boolean | |
| owner | DE-83 |
| owner_facet | DE-83 |
| physical | X, 224 S. graph. Darst. |
| psigel | TUB-nve |
| publishDate | 1987 |
| publishDateSearch | 1987 |
| publishDateSort | 1987 |
| publisher | Wiley |
| record_format | marc |
| series2 | Wiley series in computing A Wiley-Interscience publication |
| spelling | Kronsjö, Lydia I. Verfasser aut Computational Complexity of sequential and parallel algorithms Lydia Kronsjö Repr. Chicester <<[u.a.]>> Wiley 1987 X, 224 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Wiley series in computing A Wiley-Interscience publication Algorithmus (DE-588)4001183-5 gnd rswk-swf Komplexität (DE-588)4135369-9 gnd rswk-swf Paralleler Algorithmus (DE-588)4193615-2 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Komplexität (DE-588)4135369-9 s Algorithmus (DE-588)4001183-5 s DE-604 Komplexitätstheorie (DE-588)4120591-1 s 1\p DE-604 Paralleler Algorithmus (DE-588)4193615-2 s 2\p DE-604 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Kronsjö, Lydia I. Computational Complexity of sequential and parallel algorithms Algorithmus (DE-588)4001183-5 gnd Komplexität (DE-588)4135369-9 gnd Paralleler Algorithmus (DE-588)4193615-2 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4135369-9 (DE-588)4193615-2 (DE-588)4120591-1 |
| title | Computational Complexity of sequential and parallel algorithms |
| title_auth | Computational Complexity of sequential and parallel algorithms |
| title_exact_search | Computational Complexity of sequential and parallel algorithms |
| title_full | Computational Complexity of sequential and parallel algorithms Lydia Kronsjö |
| title_fullStr | Computational Complexity of sequential and parallel algorithms Lydia Kronsjö |
| title_full_unstemmed | Computational Complexity of sequential and parallel algorithms Lydia Kronsjö |
| title_short | Computational Complexity of sequential and parallel algorithms |
| title_sort | computational complexity of sequential and parallel algorithms |
| topic | Algorithmus (DE-588)4001183-5 gnd Komplexität (DE-588)4135369-9 gnd Paralleler Algorithmus (DE-588)4193615-2 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
| topic_facet | Algorithmus Komplexität Paralleler Algorithmus Komplexitätstheorie |
| work_keys_str_mv | AT kronsjolydiai computationalcomplexityofsequentialandparallelalgorithms |