Computational complexity of sequential and parallel algorithms:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Chichester u.a.
Wiley
1987
|
| Ausgabe: | Reprinted |
| 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 | BV009833057 | ||
| 003 | DE-604 | ||
| 005 | 20060131 | ||
| 007 | t | ||
| 008 | 941006s1987 d||| |||| 00||| eng d | ||
| 020 | |a 0471908142 |9 0-471-90814-2 | ||
| 035 | |a (OCoLC)258653863 | ||
| 035 | |a (DE-599)BVBBV009833057 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 | ||
| 082 | 0 | |a 001.64/2 | |
| 082 | 0 | |a 511'.8 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 100 | 1 | |a Kronsjö, Lydia |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Computational complexity of sequential and parallel algorithms |c Lydia Kronsjö |
| 250 | |a Reprinted | ||
| 264 | 1 | |a Chichester 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 Komplexitätstheorie |0 (DE-588)4120591-1 |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 Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Paralleler Algorithmus |0 (DE-588)4193615-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Komplexität |0 (DE-588)4135369-9 |D s |
| 689 | 1 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 689 | 2 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 2 | 1 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 2 | |8 2\p |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006510473 | ||
| 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_ | 1804124188801236992 |
|---|---|
| any_adam_object | |
| author | Kronsjö, Lydia |
| author_facet | Kronsjö, Lydia |
| author_role | aut |
| author_sort | Kronsjö, Lydia |
| author_variant | l k lk |
| building | Verbundindex |
| bvnumber | BV009833057 |
| classification_rvk | ST 130 ST 134 |
| ctrlnum | (OCoLC)258653863 (DE-599)BVBBV009833057 |
| dewey-full | 001.64/2 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.64/2 511'.8 |
| dewey-search | 001.64/2 511'.8 |
| dewey-sort | 11.64 12 |
| dewey-tens | 000 - Computer science, information, general works 510 - Mathematics |
| discipline | Allgemeines Informatik Mathematik |
| edition | Reprinted |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01781nam a2200505 c 4500</leader><controlfield tag="001">BV009833057</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20060131 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">941006s1987 d||| |||| 00||| eng 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)BVBBV009833057</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">001.64/2</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="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kronsjö, Lydia</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">Reprinted</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Chichester 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">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="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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" 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="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="1" 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="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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" 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="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006510473</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.BV009833057 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:41:42Z |
| institution | BVB |
| isbn | 0471908142 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006510473 |
| oclc_num | 258653863 |
| open_access_boolean | |
| owner | DE-703 |
| owner_facet | DE-703 |
| physical | X, 224 S. graph. Darst. |
| publishDate | 1987 |
| publishDateSearch | 1987 |
| publishDateSort | 1987 |
| publisher | Wiley |
| record_format | marc |
| series2 | Wiley series in computing A Wiley-interscience publication |
| spelling | Kronsjö, Lydia Verfasser aut Computational complexity of sequential and parallel algorithms Lydia Kronsjö Reprinted Chichester u.a. Wiley 1987 X, 224 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Wiley series in computing A Wiley-interscience publication Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Komplexität (DE-588)4135369-9 gnd rswk-swf Paralleler Algorithmus (DE-588)4193615-2 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Paralleler Algorithmus (DE-588)4193615-2 s DE-604 Komplexität (DE-588)4135369-9 s Algorithmus (DE-588)4001183-5 s 1\p DE-604 Komplexitätstheorie (DE-588)4120591-1 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 Computational complexity of sequential and parallel algorithms Komplexitätstheorie (DE-588)4120591-1 gnd Komplexität (DE-588)4135369-9 gnd Paralleler Algorithmus (DE-588)4193615-2 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4120591-1 (DE-588)4135369-9 (DE-588)4193615-2 (DE-588)4001183-5 |
| 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 | Komplexitätstheorie (DE-588)4120591-1 gnd Komplexität (DE-588)4135369-9 gnd Paralleler Algorithmus (DE-588)4193615-2 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Komplexitätstheorie Komplexität Paralleler Algorithmus Algorithmus |
| work_keys_str_mv | AT kronsjolydia computationalcomplexityofsequentialandparallelalgorithms |