Algorithms: their complexity and efficieny
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Chichester [u.a.]
Wiley
1987
|
| Schriftenreihe: | Wiley series in computing
|
| Schlagworte: | |
| Beschreibung: | XIII, 363 S. |
| ISBN: | 0471912018 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021874672 | ||
| 003 | DE-604 | ||
| 005 | 20060630000000.0 | ||
| 007 | t | ||
| 008 | 871221s1987 |||| 00||| eng d | ||
| 020 | |a 0471912018 |9 0-471-91201-8 | ||
| 035 | |a (OCoLC)13794964 | ||
| 035 | |a (DE-599)BVBBV021874672 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 050 | 0 | |a QA76.6 | |
| 082 | 0 | |a 511 |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 efficieny |
| 264 | 1 | |a Chichester [u.a.] |b Wiley |c 1987 | |
| 300 | |a XIII, 363 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Wiley series in computing | |
| 650 | 4 | |a Algorithmes | |
| 650 | 7 | |a Algorithmes |2 ram | |
| 650 | 4 | |a Analyse numérique - Informatique | |
| 650 | 7 | |a Analyse numérique |2 ram | |
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 7 | |a Complexité de calcul (informatique) |2 ram | |
| 650 | 7 | |a FFT |2 inriac | |
| 650 | 7 | |a Ordinateurs - Programmation |2 ram | |
| 650 | 4 | |a Programmation (Informatique) | |
| 650 | 7 | |a algorithme efficace |2 inriac | |
| 650 | 7 | |a algorithme recherche |2 inriac | |
| 650 | 7 | |a algorithme tri |2 inriac | |
| 650 | 7 | |a complexité algorithme |2 inriac | |
| 650 | 7 | |a multiplication |2 inriac | |
| 650 | 7 | |a processus itératif |2 inriac | |
| 650 | 7 | |a évaluation polynome |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 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 |
| 650 | 0 | 7 | |a Datenverarbeitung |0 (DE-588)4011152-0 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Numerische Mathematik |0 (DE-588)4042805-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | 1 | |a Datenverarbeitung |0 (DE-588)4011152-0 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015090377 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804135813738397696 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| 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 | BV021874672 |
| 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)13794964 (DE-599)BVBBV021874672 |
| dewey-full | 511 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511 |
| dewey-search | 511 |
| dewey-sort | 3511 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02205nam a2200661zc 4500</leader><controlfield tag="001">BV021874672</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20060630000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">871221s1987 |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0471912018</subfield><subfield code="9">0-471-91201-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)13794964</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021874672</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.6</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511</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 efficieny</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">XIII, 363 S.</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="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithmes</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Analyse numérique - Informatique</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Analyse numérique</subfield><subfield code="2">ram</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">Complexité de calcul (informatique)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">FFT</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Ordinateurs - Programmation</subfield><subfield code="2">ram</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 efficace</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme recherche</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme tri</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">complexité algorithme</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">multiplication</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">évaluation polynome</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">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="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="689" ind1="0" 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="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">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</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="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015090377</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></record></collection> |
| id | DE-604.BV021874672 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:03:32Z |
| indexdate | 2024-07-09T20:46:28Z |
| institution | BVB |
| isbn | 0471912018 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015090377 |
| oclc_num | 13794964 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | XIII, 363 S. |
| publishDate | 1987 |
| publishDateSearch | 1987 |
| publishDateSort | 1987 |
| publisher | Wiley |
| record_format | marc |
| series2 | Wiley series in computing |
| spelling | Kronsjö, Lydia I. Verfasser aut Algorithms their complexity and efficieny Chichester [u.a.] Wiley 1987 XIII, 363 S. txt rdacontent n rdamedia nc rdacarrier Wiley series in computing Algorithmes Algorithmes ram Analyse numérique - Informatique Analyse numérique ram Complexité de calcul (Informatique) Complexité de calcul (informatique) ram FFT inriac Ordinateurs - Programmation ram Programmation (Informatique) algorithme efficace inriac algorithme recherche inriac algorithme tri inriac complexité algorithme inriac multiplication inriac processus itératif inriac évaluation polynome inriac Datenverarbeitung Computational complexity Computer algorithms Computer programming Numerical analysis Data processing Numerische Mathematik (DE-588)4042805-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Datenverarbeitung (DE-588)4011152-0 gnd rswk-swf Numerische Mathematik (DE-588)4042805-9 s DE-604 Algorithmus (DE-588)4001183-5 s Datenverarbeitung (DE-588)4011152-0 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 efficieny Algorithmes Algorithmes ram Analyse numérique - Informatique Analyse numérique ram Complexité de calcul (Informatique) Complexité de calcul (informatique) ram FFT inriac Ordinateurs - Programmation ram Programmation (Informatique) algorithme efficace inriac algorithme recherche inriac algorithme tri inriac complexité algorithme inriac multiplication inriac processus itératif inriac évaluation polynome inriac Datenverarbeitung Computational complexity Computer algorithms Computer programming Numerical analysis Data processing Numerische Mathematik (DE-588)4042805-9 gnd Algorithmus (DE-588)4001183-5 gnd Datenverarbeitung (DE-588)4011152-0 gnd |
| subject_GND | (DE-588)4042805-9 (DE-588)4001183-5 (DE-588)4011152-0 |
| title | Algorithms their complexity and efficieny |
| title_auth | Algorithms their complexity and efficieny |
| title_exact_search | Algorithms their complexity and efficieny |
| title_exact_search_txtP | Algorithms their complexity and efficieny |
| title_full | Algorithms their complexity and efficieny |
| title_fullStr | Algorithms their complexity and efficieny |
| title_full_unstemmed | Algorithms their complexity and efficieny |
| title_short | Algorithms |
| title_sort | algorithms their complexity and efficieny |
| title_sub | their complexity and efficieny |
| topic | Algorithmes Algorithmes ram Analyse numérique - Informatique Analyse numérique ram Complexité de calcul (Informatique) Complexité de calcul (informatique) ram FFT inriac Ordinateurs - Programmation ram Programmation (Informatique) algorithme efficace inriac algorithme recherche inriac algorithme tri inriac complexité algorithme inriac multiplication inriac processus itératif inriac évaluation polynome inriac Datenverarbeitung Computational complexity Computer algorithms Computer programming Numerical analysis Data processing Numerische Mathematik (DE-588)4042805-9 gnd Algorithmus (DE-588)4001183-5 gnd Datenverarbeitung (DE-588)4011152-0 gnd |
| topic_facet | Algorithmes Analyse numérique - Informatique Analyse numérique Complexité de calcul (Informatique) Complexité de calcul (informatique) FFT Ordinateurs - Programmation Programmation (Informatique) algorithme efficace algorithme recherche algorithme tri complexité algorithme multiplication processus itératif évaluation polynome Datenverarbeitung Computational complexity Computer algorithms Computer programming Numerical analysis Data processing Numerische Mathematik Algorithmus |
| work_keys_str_mv | AT kronsjolydiai algorithmstheircomplexityandefficieny |