Da: World of Books (was SecondSale), Montgomery, IL, U.S.A.
Hardback. Condizione: Good. 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. Codice articolo CIN376433102XG
Quantità: 1 disponibili
Da: World of Books Inc, Montgomery, IL, U.S.A.
Hardback. Condizione: Good. 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. Codice articolo CIN376433102XG
Quantità: 1 disponibili
Da: BooksByLisa, Highland Park, IL, U.S.A.
Hardcover. Condizione: New. Condizione sovraccoperta: New. Second Edition. PHOTO AND VIDEO OF PAGES TAKEN TO SHOW CONDITION PRIOR TO SHIPPING; . PHOTOS EMAILED FOR MORE SPECIFICS WHEN REQUESTED; Book. Book. Codice articolo 259
Quantità: 1 disponibili
Da: Aspen Book Co., Denver, CO, U.S.A.
Hardcover. Condizione: Good. Second Edition. The book is in very good condition with a sturdy hardcover binding. There is no dust jacket present. The cover shows minor signs of wear, typical for its age, but the pages are clean and intact, ensuring a pleasant reading experience. There are no inscriptions or library markings. ###. Codice articolo A24-B9-TNP-GZZ-0103
Quantità: 1 disponibili
Da: Southampton Books, Sag Harbor, NY, U.S.A.
Hardcover. Condizione: Like New. 2nd EDITION. Second Edition, First Printing. Published by Birkauser, 1982. Octavo. Hardcover. Book is like new. No dust jacket. Codice articolo 541612
Quantità: 1 disponibili
Da: SuzyQBooks, Salt Lake City, UT, U.S.A.
Hardcover. Condizione: Very Good. No Jacket. Second Edition. Owner name fep. Codice articolo 014277
Quantità: 1 disponibili
Da: Bingo Books 2, Vancouver, WA, U.S.A.
Hardcover. Condizione: Near Fine. 2nd Edition. 2nd ed,hardback book in near fine condition. Codice articolo 127576
Quantità: 1 disponibili
Da: Anybook.com, Lincoln, Regno Unito
Condizione: Good. Volume 1. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,450grams, ISBN:376433102X. Codice articolo 3899927
Quantità: 1 disponibili
Da: PASCALE'S BOOKS, NORTH READING, MA, U.S.A.
Hard Cover. Condizione: Fine. 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. Size: 8vo - over 7¾" - 9¾" tall. Codice articolo 022589
Quantità: 1 disponibili
Da: BennettBooksLtd, Los Angeles, CA, U.S.A.
Condizione: New. New. In shrink wrap. Looks like an interesting title! 0.8. Codice articolo Q-376433102X
Quantità: 1 disponibili