Falls Sie nur an einem bestimmten Exempar interessiert sind, können Sie aus der folgenden Liste jenes wählen, an dem Sie interessiert sind:
Nur diese Ausgabe anzeigen…
Nur diese Ausgabe anzeigen…
Nur diese Ausgabe anzeigen…
Nur diese Ausgabe anzeigen…
Nur diese Ausgabe anzeigen…
Nur diese Ausgabe anzeigen…
Mathematics for the analysis of algorithms (Progress in computer science)
15 Angebote vergleichen
Preise | 2016 | 2017 | 2023 |
---|---|---|---|
Schnitt | € 6,65 | € 17,06 | € 20,11 |
Nachfrage |
Mathematics for the Analysis of Algorithms (Progress in Computer Science) (1982)
ISBN: 9783764331023 bzw. 376433102X, vermutlich in Englisch, 2. Ausgabe, Birka¨user, gebundenes Buch, gebraucht, akzeptabler Zustand.
Von Händler/Antiquariat, HPB-Red, TX, Carrollton, [RE:4].
Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Hardcover, 2nd ed.
MATHEMATICS FOR THE ANALYSIS OF ALGORITHMS. (1982)
ISBN: 9783764331023 bzw. 376433102X, vermutlich in Englisch, Birkhauser, gebundenes Buch, gebraucht, guter Zustand.
Von Händler/Antiquariat, PASCALE'S BOOKS.
Birkhauser:, 1982. The second edition, 123 pages. "Now in an expanded, updated edition, this book builds on the fundamental of complex variable theory and combinatorial analysis, presenting many of the major problems used in the precise analysis of algorithms. With coverage of binomial identities, recurrence relations, and asymptotic analysis, this book presents information in a useful format: terse enough fo easy referece, yet detailed enough for those with little background." FINE HARDCOVER.. Hard Cover. Fine/Not Issued with a Dust Jacket.. 8vo - over 7¾" - 9¾" tall.
Mathematics for the analysis of algorithms (Progress in computer science) (1982)
ISBN: 9783764331023 bzw. 376433102X, Band: 1, in Deutsch, Birkauser, gebundenes Buch, gebraucht.
376433102X 1982. Progress in Computer Science, Vol. 1; second edition; no dust jacket as issued; purple glossy boards; boards in very good condition; some foxing on page edges and endpapers; owner's stamp on front pastedown, but otherwise unmarked interior; tight binding; clean text; illustrations; 8vo 7 3/4" - 9 3/4" Tall; 123 pages.
Mathematics for the Analysis of Algorithms (2008)
ISBN: 9780817647285 bzw. 0817647287, vermutlich in Englisch, Birkhauser, Taschenbuch, gebraucht, guter Zustand, Nachdruck.
Von Händler/Antiquariat, PsychoBabel & Skoob Books.
Boston: Birkhauser, 2008. Paperback, kinked as a whole towards upper corners; remains very good, with clean, sound pages. Third edition, reprint of the 1990 edition. TS. Paperback. Very Good. Used.
Mathematics for the Analysis of Algorithms (1982)
ISBN: 9783764331023 bzw. 376433102X, in Deutsch, Birkauser, gebundenes Buch, gebraucht.
376433102x Notes/underlining to approximately 10% of pgs. NOT a former library book. Previous owner's name & some helpful notes on endpaper. Tight, sturdy copy. This monograph collects some fundamental mathematical techniques that are required for the analysis of algorithms. It 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 concise enough for easy reference yet detailed enough for those with little background with the material.
Mathematics for the Analysis of Algorithms (1982)
ISBN: 376433102X bzw. 9783764331023, in Deutsch, Birkenhäuser Verlag, Basel/Boston/Stuttgart, Schweiz, gebundenes Buch.
Von Händler/Antiquariat, PsychoBabel Books [psycho].
Boston, Birkauser. 1982. (ISBN: 376433102x). hardcover. Ex - Library, Usual Stamps, pages are clean, bright and tight. Very Good/No Dust Jacket.
Mathematics for the Analysis of Algorithms
ISBN: 9780817647285 bzw. 0817647287, in Englisch, Birkh User.
Mathematics for the Analysis of Algorithms Greene, Daniel H. / Knuth, Donald E. 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.
Mathematics for the analysis of algorithms (Progress in computer science)
ISBN: 9783764331023 bzw. 376433102X, in Deutsch, Birkauser, gebundenes Buch, gebraucht.
This book has a light amount of wear to the pages, cover and binding.
Mathematics for the Analysis of Algorithms (2007)
ISBN: 9780817647285 bzw. 0817647287, vermutlich in Englisch, 132 Seiten, 3. Ausgabe, Birkhaeuser Boston, Taschenbuch, neu, Nachdruck.
Von Händler/Antiquariat, Moluna GmbH, [5901482].
Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. A collection of some fundamental mathematical techniques that are required for the analysis of algorithms Is very well written the style and the mathematical ex, 2007, Kartoniert / Broschiert, Neuware, Softcover, 470g, 3. Auflage Reprint, 132, Banküberweisung, PayPal.
Mathematics for the Analysis of Algorithms
ISBN: 9780817647285 bzw. 0817647287, vermutlich in Englisch, Springer Nature, Taschenbuch, neu.
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. Soft cover.