Mathematics for the Analysis of Algorithms:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Boston, MA
Birkhäuser Boston
1990
|
| Ausgabe: | Third Edition |
| Schriftenreihe: | Progress in Computer Science and Applied Logic (PCS)
1 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | A quantitative study of the efficiency of computer methods requires an in-depth understanding of both mathematics and computer science. This monograph, derived from an advanced computer science course at Stanford University, builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is terse enough for easy reference yet detailed enough for those with little background. Approximately half the book is devoted to original problems and solutions from examinations given at Stanford. "...a very valuable collection of mathematical techniques for the analysis of algorithms..." — Mathematical Reviews "The book covers the important mathematical tools used in computer science, especially in the exact analysis of algorithms. A wide range of topics are covered, from the binomial theorem to the saddle point method and Laplace’s techniques for asymptotic analysis...The book is very well written. The style and the mathematical exposition make the book pleasant to read...It covers many of the major paradigms used in the analysis of algorithms in its one hundred plus pages." — SIAM Review "The book presents a welcome selection and careful exposition of material that can be (and is) covered in a single course...In this reviewer’s opinion, this would be an interesting text to use with a group of advanced students well-grounded in undergraduate mathematics and computer science, and would produce a valuable course for the participating students." — Computing Reviews |
| Beschreibung: | 1 Online-Ressource (VIII, 132 p) |
| ISBN: | 9780817647292 9780817647285 |
| DOI: | 10.1007/978-0-8176-4729-2 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042419152 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s1990 |||| o||u| ||||||eng d | ||
| 020 | |a 9780817647292 |c Online |9 978-0-8176-4729-2 | ||
| 020 | |a 9780817647285 |c Print |9 978-0-8176-4728-5 | ||
| 024 | 7 | |a 10.1007/978-0-8176-4729-2 |2 doi | |
| 035 | |a (OCoLC)858025434 | ||
| 035 | |a (DE-599)BVBBV042419152 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 518.1 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Greene, Daniel H. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Mathematics for the Analysis of Algorithms |c by Daniel H. Greene, Donald E. Knuth |
| 250 | |a Third Edition | ||
| 264 | 1 | |a Boston, MA |b Birkhäuser Boston |c 1990 | |
| 300 | |a 1 Online-Ressource (VIII, 132 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Progress in Computer Science and Applied Logic (PCS) |v 1 | |
| 500 | |a A quantitative study of the efficiency of computer methods requires an in-depth understanding of both mathematics and computer science. This monograph, derived from an advanced computer science course at Stanford University, builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is terse enough for easy reference yet detailed enough for those with little background. Approximately half the book is devoted to original problems and solutions from examinations given at Stanford. "...a very valuable collection of mathematical techniques for the analysis of algorithms..." — Mathematical Reviews "The book covers the important mathematical tools used in computer science, especially in the exact analysis of algorithms. A wide range of topics are covered, from the binomial theorem to the saddle point method and Laplace’s techniques for asymptotic analysis...The book is very well written. The style and the mathematical exposition make the book pleasant to read...It covers many of the major paradigms used in the analysis of algorithms in its one hundred plus pages." — SIAM Review "The book presents a welcome selection and careful exposition of material that can be (and is) covered in a single course...In this reviewer’s opinion, this would be an interesting text to use with a group of advanced students well-grounded in undergraduate mathematics and computer science, and would produce a valuable course for the participating students." — Computing Reviews | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Computer software | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Algorithm Analysis and Problem Complexity | |
| 650 | 4 | |a Computational Science and Engineering | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Mathematik | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmentheorie |0 (DE-588)4200409-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datenverarbeitung |0 (DE-588)4011152-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mathematik |0 (DE-588)4037944-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 1 | |a Mathematik |0 (DE-588)4037944-9 |D s |
| 689 | 0 | |8 1\p |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 2\p |5 DE-604 | |
| 689 | 2 | 0 | |a Algorithmentheorie |0 (DE-588)4200409-3 |D s |
| 689 | 2 | |8 3\p |5 DE-604 | |
| 700 | 1 | |a Knuth, Donald E. |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-0-8176-4729-2 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027854569 | ||
| 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 | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804153089429602304 |
|---|---|
| any_adam_object | |
| author | Greene, Daniel H. |
| author_facet | Greene, Daniel H. |
| author_role | aut |
| author_sort | Greene, Daniel H. |
| author_variant | d h g dh dhg |
| building | Verbundindex |
| bvnumber | BV042419152 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)858025434 (DE-599)BVBBV042419152 |
| dewey-full | 518.1 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 518 - Numerical analysis |
| dewey-raw | 518.1 |
| dewey-search | 518.1 |
| dewey-sort | 3518.1 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1007/978-0-8176-4729-2 |
| edition | Third Edition |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04148nmm a2200661zcb4500</leader><controlfield tag="001">BV042419152</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s1990 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780817647292</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-8176-4729-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780817647285</subfield><subfield code="c">Print</subfield><subfield code="9">978-0-8176-4728-5</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-0-8176-4729-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)858025434</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042419152</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">518.1</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Greene, Daniel H.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Mathematics for the Analysis of Algorithms</subfield><subfield code="c">by Daniel H. Greene, Donald E. Knuth</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Third Edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Birkhäuser Boston</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (VIII, 132 p)</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">Progress in Computer Science and Applied Logic (PCS)</subfield><subfield code="v">1</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">A quantitative study of the efficiency of computer methods requires an in-depth understanding of both mathematics and computer science. This monograph, derived from an advanced computer science course at Stanford University, builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is terse enough for easy reference yet detailed enough for those with little background. Approximately half the book is devoted to original problems and solutions from examinations given at Stanford. "...a very valuable collection of mathematical techniques for the analysis of algorithms..." — Mathematical Reviews "The book covers the important mathematical tools used in computer science, especially in the exact analysis of algorithms. A wide range of topics are covered, from the binomial theorem to the saddle point method and Laplace’s techniques for asymptotic analysis...The book is very well written. The style and the mathematical exposition make the book pleasant to read...It covers many of the major paradigms used in the analysis of algorithms in its one hundred plus pages." — SIAM Review "The book presents a welcome selection and careful exposition of material that can be (and is) covered in a single course...In this reviewer’s opinion, this would be an interesting text to use with a group of advanced students well-grounded in undergraduate mathematics and computer science, and would produce a valuable course for the participating students." — Computing Reviews</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer software</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm Analysis and Problem Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational Science and Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</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">Algorithmentheorie</subfield><subfield code="0">(DE-588)4200409-3</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="650" ind1="0" ind2="7"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</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">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><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">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Algorithmentheorie</subfield><subfield code="0">(DE-588)4200409-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Knuth, Donald E.</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/978-0-8176-4729-2</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027854569</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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\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.BV042419152 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:04Z |
| institution | BVB |
| isbn | 9780817647292 9780817647285 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027854569 |
| oclc_num | 858025434 |
| open_access_boolean | |
| owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| physical | 1 Online-Ressource (VIII, 132 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| publisher | Birkhäuser Boston |
| record_format | marc |
| series2 | Progress in Computer Science and Applied Logic (PCS) |
| spelling | Greene, Daniel H. Verfasser aut Mathematics for the Analysis of Algorithms by Daniel H. Greene, Donald E. Knuth Third Edition Boston, MA Birkhäuser Boston 1990 1 Online-Ressource (VIII, 132 p) txt rdacontent c rdamedia cr rdacarrier Progress in Computer Science and Applied Logic (PCS) 1 A quantitative study of the efficiency of computer methods requires an in-depth understanding of both mathematics and computer science. This monograph, derived from an advanced computer science course at Stanford University, builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is terse enough for easy reference yet detailed enough for those with little background. Approximately half the book is devoted to original problems and solutions from examinations given at Stanford. "...a very valuable collection of mathematical techniques for the analysis of algorithms..." — Mathematical Reviews "The book covers the important mathematical tools used in computer science, especially in the exact analysis of algorithms. A wide range of topics are covered, from the binomial theorem to the saddle point method and Laplace’s techniques for asymptotic analysis...The book is very well written. The style and the mathematical exposition make the book pleasant to read...It covers many of the major paradigms used in the analysis of algorithms in its one hundred plus pages." — SIAM Review "The book presents a welcome selection and careful exposition of material that can be (and is) covered in a single course...In this reviewer’s opinion, this would be an interesting text to use with a group of advanced students well-grounded in undergraduate mathematics and computer science, and would produce a valuable course for the participating students." — Computing Reviews Mathematics Computer software Algorithms Computer science Algorithm Analysis and Problem Complexity Computational Science and Engineering Informatik Mathematik Algorithmus (DE-588)4001183-5 gnd rswk-swf Algorithmentheorie (DE-588)4200409-3 gnd rswk-swf Datenverarbeitung (DE-588)4011152-0 gnd rswk-swf Mathematik (DE-588)4037944-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 s Mathematik (DE-588)4037944-9 s 1\p DE-604 Datenverarbeitung (DE-588)4011152-0 s 2\p DE-604 Algorithmentheorie (DE-588)4200409-3 s 3\p DE-604 Knuth, Donald E. Sonstige oth https://doi.org/10.1007/978-0-8176-4729-2 Verlag Volltext 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 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Greene, Daniel H. Mathematics for the Analysis of Algorithms Mathematics Computer software Algorithms Computer science Algorithm Analysis and Problem Complexity Computational Science and Engineering Informatik Mathematik Algorithmus (DE-588)4001183-5 gnd Algorithmentheorie (DE-588)4200409-3 gnd Datenverarbeitung (DE-588)4011152-0 gnd Mathematik (DE-588)4037944-9 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4200409-3 (DE-588)4011152-0 (DE-588)4037944-9 |
| title | Mathematics for the Analysis of Algorithms |
| title_auth | Mathematics for the Analysis of Algorithms |
| title_exact_search | Mathematics for the Analysis of Algorithms |
| title_full | Mathematics for the Analysis of Algorithms by Daniel H. Greene, Donald E. Knuth |
| title_fullStr | Mathematics for the Analysis of Algorithms by Daniel H. Greene, Donald E. Knuth |
| title_full_unstemmed | Mathematics for the Analysis of Algorithms by Daniel H. Greene, Donald E. Knuth |
| title_short | Mathematics for the Analysis of Algorithms |
| title_sort | mathematics for the analysis of algorithms |
| topic | Mathematics Computer software Algorithms Computer science Algorithm Analysis and Problem Complexity Computational Science and Engineering Informatik Mathematik Algorithmus (DE-588)4001183-5 gnd Algorithmentheorie (DE-588)4200409-3 gnd Datenverarbeitung (DE-588)4011152-0 gnd Mathematik (DE-588)4037944-9 gnd |
| topic_facet | Mathematics Computer software Algorithms Computer science Algorithm Analysis and Problem Complexity Computational Science and Engineering Informatik Mathematik Algorithmus Algorithmentheorie Datenverarbeitung |
| url | https://doi.org/10.1007/978-0-8176-4729-2 |
| work_keys_str_mv | AT greenedanielh mathematicsfortheanalysisofalgorithms AT knuthdonalde mathematicsfortheanalysisofalgorithms |