Cantitate/Preț
Produs
Total produse
Vezi coșul
Mathematics for the Analysis of Algorithms de Daniel H. Greene

Mathematics for the Analysis of Algorithms: Modern Birkhäuser Classics

Autor Daniel H. Greene, Donald E. Knuth
en Limba Engleză Paperback – 5 oct 2007
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.
Citește tot Restrânge

Din seria Modern Birkhäuser Classics

  • Bernhard Riemann 1826–1866: Turning Points in the Conception of Mathematics
    Preț: 37932 lei
  • 15% Ginzburg-Landau Vortices
    Preț: 46025 lei
  • Knot Theory and Its Applications
    Preț: 47765 lei
  • 15% Vector Bundles on Complex Projective Spaces: With an Appendix by S. I. Gelfand
    Preț: 56977 lei
  • Six Lectures on Commutative Algebra
    Preț: 38827 lei
  • 15% Linear Differential Equations and Group Theory from Riemann to Poincare
    Preț: 46120 lei
  • 20% Linear Programming
    Preț: 29366 lei
  • 18% Plane Algebraic Curves: Translated by John Stillwell
    Preț: 73461 lei
  • 15% Beyond the Quartic Equation
    Preț: 67994 lei
  • Linear Integral Equations: Theory & Technique
    Preț: 48166 lei
  • 18% The Navier-Stokes Equations: An Elementary Functional Analytic Approach
    Preț: 77187 lei
  • Dynamical Systems of Algebraic Origin
    Preț: 38357 lei
  • 15% Loop Spaces, Characteristic Classes and Geometric Quantization
    Preț: 46362 lei
  • Fourier Integral Operators
    Preț: 47164 lei
  • 15% H∞-Optimal Control and Related Minimax Design Problems: A Dynamic Game Approach
    Preț: 52521 lei
  • 15% Singularities of Differentiable Maps, Volume 1: Classification of Critical Points, Caustics and Wave Fronts
    Preț: 68990 lei
  • 18% Discriminants, Resultants, and Multidimensional Determinants
    Preț: 77898 lei
  • 15% Intersections of Random Walks
    Preț: 57219 lei
  • 15% Robust Nonlinear Control Design: State-Space and Lyapunov Techniques
    Preț: 62865 lei
  • 15% Introduction to Commutative Algebra and Algebraic Geometry
    Preț: 46103 lei
  • Complex Analysis: Fundamentals of the Classical Theory of Functions
    Preț: 37864 lei
  • 15% A First Course in Geometric Topology and Differential Geometry
    Preț: 53180 lei
  • 18% Physics and National Socialism: An Anthology of Primary Sources
    Preț: 78271 lei
  • 18% Optimal Control and Viscosity Solutions of Hamilton-Jacobi-Bellman Equations
    Preț: 88933 lei
  • 15% Prime Numbers and Computer Methods for Factorization
    Preț: 52761 lei
  • Matvei Petrovich Bronstein: and Soviet Theoretical Physics in the Thirties
    Preț: 37693 lei
  • Elements of the Representation Theory of the Jacobi Group
    Preț: 37788 lei
  • 15% Intersection Cohomology
    Preț: 68316 lei
  • 15% Module Theory: Endomorphism rings and direct sum decompositions in some classes of modules
    Preț: 49104 lei
  • Chain-Scattering Approach to H∞-Control
    Preț: 41219 lei
  • Visions in Mathematics: GAFA 2000 Special Volume, Part I pp. 1-453
    Preț: 39261 lei
  • 15% Discrete Thoughts: Essays on Mathematics, Science and Philosophy
    Preț: 57379 lei
  • 15% Symplectic Invariants and Hamiltonian Dynamics
    Preț: 63251 lei
  • 18% Number Theory: An approach through history From Hammurapi to Legendre
    Preț: 72035 lei
  • The Mathematical Experience, Study Edition
    Preț: 50000 lei
  • An Introduction to the Mechanics of Fluids
    Preț: 38790 lei
  • Introduction to Cardinal Arithmetic
    Preț: 45050 lei
  • Perspectives on the History of Mathematical Logic
    Preț: 37993 lei
  • 15% Evolutionary Integral Equations and Applications
    Preț: 57879 lei
  • Topics from the Theory of Numbers
    Preț: 38506 lei
  • 15% The Implicit Function Theorem: History, Theory, and Applications
    Preț: 56849 lei
  • 15% Tata Lectures on Theta II: Jacobian theta functions and differential equations
    Preț: 57364 lei
  • 15% Schrödinger Equations and Diffusion Theory
    Preț: 49264 lei
  • 20% Logic for Computer Scientists
    Preț: 37759 lei
  • 15% Generalized Polygons
    Preț: 58488 lei
  • Mathematical Control Theory: An Introduction
    Preț: 44600 lei
  • 18% Metric Structures for Riemannian and Non-Riemannian Spaces
    Preț: 78302 lei
  • 15% Tata Lectures on Theta I
    Preț: 68285 lei
  • 15% Non-vanishing of L-Functions and Applications
    Preț: 51443 lei

Preț: 40397 lei

Preț vechi: 50496 lei
-20% Nou

Puncte Express: 606
Preț estimativ în valută:
7731€ • 8054$ • 6428£

Carte tipărită la comandă

Livrare economică 10-24 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780817647285
ISBN-10: 0817647287
Pagini: 132
Ilustrații: VIII, 132 p.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.23 kg
Ediția:Reprint of the 1990 ed.
Editura: Birkhäuser Boston
Colecția Birkhäuser
Seria Modern Birkhäuser Classics

Locul publicării:Boston, MA, United States

Public țintă

Graduate

Cuprins

Binomial Identities.- Recurrence Relations.- Operator Methods.- Asymptotic analysis.

Recenzii

“This is a short cookbook of methods for analyzing the run time of computer algorithms, aimed at computer scientists … . a very erudite book, full of interesting things for both mathematicians and computer scientists … .” (Allen Stenger, MAA Reviews, September, 2015)
“Mathematics for the Analysis of Algorithms covers a variety of topics in a relatively small amount of pages. Despite its briefness, most of the topics are clearly and fully explained using detailed examples for better understanding. As such, the book is suitable for use as study material, as well as a good reference guide…The reviewer recommends this book to anyone interested in advanced theory of algorithms and the mathematics behind it, either as an exposition to the topic or as reference material in future work.”   —SIGACT NEWS
"This book collects some fundamental mathematical techniques which are required for the analysis of algorithms... This book arose from handouts for an advanced course on the analysis of algorithms at Standard University, and the appendices list lectures, homework assignments and problems for the midterm and the final exams with their solutions. In summary, this book is a very valuable collection of mathematical techniques for the analysis of algorithms and accompanies, as well as complements, the second author's series The Art of Computer Programming
."   —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
"The reader has probably heard of the expression 'good things come in small packages.' The validity of that maxim is no more in evidence than in the work under review, which is nothing less than a mathematical wellspring among the otherwise parched world of theoretical algorithm analysis. In only 76 pages (not counting the bibliography and amazing appendices), the authors cover four important topics in algorithm analysis, all from a rudimentary, but highly original,
point of view: Binomial Identities, Recurrence Relations, Operator Methods, and Asymptotic Analysis. Each of these topics is critical to understanding the modern analysis of algorithms, primarily from the speed of execution perspective... In summary, the book under review should not be underestimated in its powerful use of mathematics for the analysis of algorithms arising from computer science considerations."   —Timothy Hall, Process Quality Improvement Consulting"The analysis of algorthms is possible on mathematical and on computer scientific ways. This [book] is a mathematical look at this topic. It is based on an advanced course in computer science at Stanford University... The Appendices contain further difficult problems for applying the methods of this outstanding, full-of-thoughts book."   —P.L. Erdos (Periodica Mathematica Hungarica)

Textul de pe ultima copertă

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 a
nd 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

Caracteristici

A collection of some fundamental mathematical techniques that are required for the analysis of algorithms Is very well written; the style and the mathematical exposition make the book pleasant to read A wide range of topics are covered, including many of the major paradigms used in the analysis of algorithms, in an extremely concise manner (one hundred plus pages) Contains a wealth of highly original, instructive problems AND solutions, taken from actual examinations given at Stanford in various computer science courses Presents a welcome selection and careful exposition of material that can be covered in a single course with a group of advanced students well-grounded in undergraduate mathematics and computer science The authors cover four important topics in algorithm analysis, all from a rudimentary, but highly original, point of view; each of these topics is critical to understanding the modern analysis of algorithms, primarily from the speed of execution perspective