Analytic combinatorics:
Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability th...
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Weitere beteiligte Personen: | |
| Format: | E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2009
|
| Links: | https://doi.org/10.1017/CBO9780511801655 |
| Zusammenfassung: | Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology, and information theory. With a careful combination of symbolic enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The authors give full coverage of the underlying mathematics and a thorough treatment of both classical and modern applications of the theory. The text is complemented with exercises, examples, appendices and notes to aid understanding. The book can be used for an advanced undergraduate or a graduate course, or for self-study. |
| Umfang: | 1 Online-Ressource (xiii, 810 Seiten) |
| ISBN: | 9780511801655 |
Internformat
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9780511801655 | ||
| 003 | UkCbUP | ||
| 005 | 20151005020622.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 101021s2009||||enk o ||1 0|eng|d | ||
| 020 | |a 9780511801655 | ||
| 100 | 1 | |a Flajolet, Philippe | |
| 245 | 1 | 0 | |a Analytic combinatorics |c Philippe Flajolet & Robert Sedgewick |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2009 | |
| 300 | |a 1 Online-Ressource (xiii, 810 Seiten) | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 520 | |a Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology, and information theory. With a careful combination of symbolic enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The authors give full coverage of the underlying mathematics and a thorough treatment of both classical and modern applications of the theory. The text is complemented with exercises, examples, appendices and notes to aid understanding. The book can be used for an advanced undergraduate or a graduate course, or for self-study. | ||
| 700 | 1 | |a Sedgewick, Robert |d 1946- | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780521898065 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/CBO9780511801655 |3 Volltext |
| 912 | |a ZDB-20-CTM | ||
| 912 | |a ZDB-20-CTM | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-20-CTM-CR9780511801655 |
|---|---|
| _version_ | 1825574051254370306 |
| adam_text | |
| any_adam_object | |
| author | Flajolet, Philippe |
| author2 | Sedgewick, Robert 1946- |
| author2_role | |
| author2_variant | r s rs |
| author_facet | Flajolet, Philippe Sedgewick, Robert 1946- |
| author_role | |
| author_sort | Flajolet, Philippe |
| author_variant | p f pf |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-20-CTM |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01790nam a2200253 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9780511801655</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20151005020622.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">101021s2009||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511801655</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Flajolet, Philippe</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Analytic combinatorics</subfield><subfield code="c">Philippe Flajolet & Robert Sedgewick</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xiii, 810 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology, and information theory. With a careful combination of symbolic enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The authors give full coverage of the underlying mathematics and a thorough treatment of both classical and modern applications of the theory. The text is complemented with exercises, examples, appendices and notes to aid understanding. The book can be used for an advanced undergraduate or a graduate course, or for self-study.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sedgewick, Robert</subfield><subfield code="d">1946-</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780521898065</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/CBO9780511801655</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-20-CTM-CR9780511801655 |
| illustrated | Not Illustrated |
| indexdate | 2025-03-03T11:58:05Z |
| institution | BVB |
| isbn | 9780511801655 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (xiii, 810 Seiten) |
| psigel | ZDB-20-CTM TUM_PDA_CTM ZDB-20-CTM |
| publishDate | 2009 |
| publishDateSearch | 2009 |
| publishDateSort | 2009 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Flajolet, Philippe Analytic combinatorics Philippe Flajolet & Robert Sedgewick Cambridge Cambridge University Press 2009 1 Online-Ressource (xiii, 810 Seiten) txt c cr Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology, and information theory. With a careful combination of symbolic enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The authors give full coverage of the underlying mathematics and a thorough treatment of both classical and modern applications of the theory. The text is complemented with exercises, examples, appendices and notes to aid understanding. The book can be used for an advanced undergraduate or a graduate course, or for self-study. Sedgewick, Robert 1946- Erscheint auch als Druck-Ausgabe 9780521898065 |
| spellingShingle | Flajolet, Philippe Analytic combinatorics |
| title | Analytic combinatorics |
| title_auth | Analytic combinatorics |
| title_exact_search | Analytic combinatorics |
| title_full | Analytic combinatorics Philippe Flajolet & Robert Sedgewick |
| title_fullStr | Analytic combinatorics Philippe Flajolet & Robert Sedgewick |
| title_full_unstemmed | Analytic combinatorics Philippe Flajolet & Robert Sedgewick |
| title_short | Analytic combinatorics |
| title_sort | analytic combinatorics |
| work_keys_str_mv | AT flajoletphilippe analyticcombinatorics AT sedgewickrobert analyticcombinatorics |