Algorithms: Their complexity and efficiency
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Chichester
Wiley
1979
|
| Schriftenreihe: | Wiley series in computing.
Wiley-interscience publication. |
| Schlagworte: | |
| Beschreibung: | XV, 361 S. graph.Darst. |
| ISBN: | 0471997528 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV001997893 | ||
| 003 | DE-604 | ||
| 005 | 20031105 | ||
| 007 | t | ||
| 008 | 890928s1979 d||| |||| 00||| eng d | ||
| 020 | |a 0471997528 |9 0-471-99752-8 | ||
| 035 | |a (OCoLC)4504543 | ||
| 035 | |a (DE-599)BVBBV001997893 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-91 |a DE-384 |a DE-824 |a DE-N2 |a DE-29T |a DE-706 |a DE-83 |a DE-188 | ||
| 050 | 0 | |a QA76.6 | |
| 082 | 0 | |a 519.4 | |
| 082 | 0 | |a 511/.8 |2 19 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 100 | 1 | |a Kronsjö, Lydia I. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Algorithms |b Their complexity and efficiency |c Lydia I. Kronsjö |
| 264 | 1 | |a Chichester |b Wiley |c 1979 | |
| 300 | |a XV, 361 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 Wiley-interscience publication. | |
| 650 | 4 | |a Algorithmes | |
| 650 | 7 | |a Algoritmen |2 gtt | |
| 650 | 4 | |a Algoritmos | |
| 650 | 4 | |a Analyse numérique - Informatique | |
| 650 | 4 | |a Análisis numérico - Procesamiento electrónico de datos | |
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 7 | |a FFT |2 inriac | |
| 650 | 4 | |a Programmation (Informatique) | |
| 650 | 7 | |a algorithme complexe |2 inriac | |
| 650 | 7 | |a analyse numérique |2 inriac | |
| 650 | 7 | |a complexité calcul |2 inriac | |
| 650 | 7 | |a processus itératif |2 inriac | |
| 650 | 7 | |a programmation |2 inriac | |
| 650 | 7 | |a théorème convolution |2 inriac | |
| 650 | 7 | |a équation linéaire |2 inriac | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Computer programming | |
| 650 | 4 | |a Numerical analysis |x Data processing | |
| 650 | 0 | 7 | |a Datenverarbeitung |0 (DE-588)4011152-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Numerische Mathematik |0 (DE-588)4042805-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 1 | |a Datenverarbeitung |0 (DE-588)4011152-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Numerische Mathematik |0 (DE-588)4042805-9 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 940 | 1 | |q TUB-nveb | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-001303225 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 980 | 4 | |a (DE-12)AK12390366 | |
Datensatz im Suchindex
| _version_ | 1804116445203791872 |
|---|---|
| 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 | BV001997893 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.6 |
| callnumber-search | QA76.6 |
| callnumber-sort | QA 276.6 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 130 |
| ctrlnum | (OCoLC)4504543 (DE-599)BVBBV001997893 |
| dewey-full | 519.4 511/.8 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics 511 - General principles of mathematics |
| dewey-raw | 519.4 511/.8 |
| dewey-search | 519.4 511/.8 |
| dewey-sort | 3519.4 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02382nam a2200697 c 4500</leader><controlfield tag="001">BV001997893</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20031105 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">890928s1979 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0471997528</subfield><subfield code="9">0-471-99752-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)4504543</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV001997893</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-12</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-N2</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.6</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.4</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.8</subfield><subfield code="2">19</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">Algorithms</subfield><subfield code="b">Their complexity and efficiency</subfield><subfield code="c">Lydia I. Kronsjö</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Chichester</subfield><subfield code="b">Wiley</subfield><subfield code="c">1979</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 361 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">Wiley-interscience publication.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algoritmos</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Analyse numérique - Informatique</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Análisis numérico - Procesamiento electrónico de datos</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">FFT</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programmation (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme complexe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">analyse numérique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">complexité calcul</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">processus itératif</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">programmation</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorème convolution</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">équation linéaire</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Numerical analysis</subfield><subfield code="x">Data processing</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Numerische Mathematik</subfield><subfield code="0">(DE-588)4042805-9</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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</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">Numerische Mathematik</subfield><subfield code="0">(DE-588)4042805-9</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="940" ind1="1" ind2=" "><subfield code="q">TUB-nveb</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-001303225</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="980" ind1="4" ind2=" "><subfield code="a">(DE-12)AK12390366</subfield></datafield></record></collection> |
| id | DE-604.BV001997893 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T15:38:37Z |
| institution | BVB |
| isbn | 0471997528 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001303225 |
| oclc_num | 4504543 |
| open_access_boolean | |
| owner | DE-12 DE-91 DE-BY-TUM DE-384 DE-824 DE-N2 DE-29T DE-706 DE-83 DE-188 |
| owner_facet | DE-12 DE-91 DE-BY-TUM DE-384 DE-824 DE-N2 DE-29T DE-706 DE-83 DE-188 |
| physical | XV, 361 S. graph.Darst. |
| psigel | TUB-nveb |
| publishDate | 1979 |
| publishDateSearch | 1979 |
| publishDateSort | 1979 |
| publisher | Wiley |
| record_format | marc |
| series2 | Wiley series in computing. Wiley-interscience publication. |
| spelling | Kronsjö, Lydia I. Verfasser aut Algorithms Their complexity and efficiency Lydia I. Kronsjö Chichester Wiley 1979 XV, 361 S. graph.Darst. txt rdacontent n rdamedia nc rdacarrier Wiley series in computing. Wiley-interscience publication. Algorithmes Algoritmen gtt Algoritmos Analyse numérique - Informatique Análisis numérico - Procesamiento electrónico de datos Complexité de calcul (Informatique) FFT inriac Programmation (Informatique) algorithme complexe inriac analyse numérique inriac complexité calcul inriac processus itératif inriac programmation inriac théorème convolution inriac équation linéaire inriac Datenverarbeitung Computational complexity Computer algorithms Computer programming Numerical analysis Data processing Datenverarbeitung (DE-588)4011152-0 gnd rswk-swf Numerische Mathematik (DE-588)4042805-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 s Datenverarbeitung (DE-588)4011152-0 s DE-604 Numerische Mathematik (DE-588)4042805-9 s 1\p DE-604 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Kronsjö, Lydia I. Algorithms Their complexity and efficiency Algorithmes Algoritmen gtt Algoritmos Analyse numérique - Informatique Análisis numérico - Procesamiento electrónico de datos Complexité de calcul (Informatique) FFT inriac Programmation (Informatique) algorithme complexe inriac analyse numérique inriac complexité calcul inriac processus itératif inriac programmation inriac théorème convolution inriac équation linéaire inriac Datenverarbeitung Computational complexity Computer algorithms Computer programming Numerical analysis Data processing Datenverarbeitung (DE-588)4011152-0 gnd Numerische Mathematik (DE-588)4042805-9 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4011152-0 (DE-588)4042805-9 (DE-588)4001183-5 |
| title | Algorithms Their complexity and efficiency |
| title_auth | Algorithms Their complexity and efficiency |
| title_exact_search | Algorithms Their complexity and efficiency |
| title_full | Algorithms Their complexity and efficiency Lydia I. Kronsjö |
| title_fullStr | Algorithms Their complexity and efficiency Lydia I. Kronsjö |
| title_full_unstemmed | Algorithms Their complexity and efficiency Lydia I. Kronsjö |
| title_short | Algorithms |
| title_sort | algorithms their complexity and efficiency |
| title_sub | Their complexity and efficiency |
| topic | Algorithmes Algoritmen gtt Algoritmos Analyse numérique - Informatique Análisis numérico - Procesamiento electrónico de datos Complexité de calcul (Informatique) FFT inriac Programmation (Informatique) algorithme complexe inriac analyse numérique inriac complexité calcul inriac processus itératif inriac programmation inriac théorème convolution inriac équation linéaire inriac Datenverarbeitung Computational complexity Computer algorithms Computer programming Numerical analysis Data processing Datenverarbeitung (DE-588)4011152-0 gnd Numerische Mathematik (DE-588)4042805-9 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Algorithmes Algoritmen Algoritmos Analyse numérique - Informatique Análisis numérico - Procesamiento electrónico de datos Complexité de calcul (Informatique) FFT Programmation (Informatique) algorithme complexe analyse numérique complexité calcul processus itératif programmation théorème convolution équation linéaire Datenverarbeitung Computational complexity Computer algorithms Computer programming Numerical analysis Data processing Numerische Mathematik Algorithmus |
| work_keys_str_mv | AT kronsjolydiai algorithmstheircomplexityandefficiency |