• Home
  • Advanced Search
  • Directory of Libraries
  • About lib.ir
  • Contact Us
  • History

عنوان
Mathematics for the Analysis of Algorithms

پدید آورنده
by Daniel H. Greene, Donald E. Knuth.

موضوع
Algorithms.,Computer science.,Computer software.,Mathematics.

رده

کتابخانه
Center and Library of Islamic Studies in European Languages

محل استقرار
استان: Qom ـ شهر: Qom

Center and Library of Islamic Studies in European Languages

تماس با کتابخانه : 32910706-025

INTERNATIONAL STANDARD BOOK NUMBER

(Number (ISBN
9780817647285
(Number (ISBN
9780817647292

NATIONAL BIBLIOGRAPHY NUMBER

Number
b401779

TITLE AND STATEMENT OF RESPONSIBILITY

Title Proper
Mathematics for the Analysis of Algorithms
General Material Designation
[Book]
First Statement of Responsibility
by Daniel H. Greene, Donald E. Knuth.

EDITION STATEMENT

Edition Statement
Third Edition.

.PUBLICATION, DISTRIBUTION, ETC

Place of Publication, Distribution, etc.
Boston, MA :
Name of Publisher, Distributor, etc.
Birkhäuser Boston,
Date of Publication, Distribution, etc.
1990.

SERIES

Series Title
Progress in Computer Science and Applied Logic (PCS) ;
Volume Designation
1

CONTENTS NOTE

Text of Note
Binomial Identities -- Recurrence Relations -- Operator Methods -- Asymptotic analysis.
0

SUMMARY OR ABSTRACT

Text of Note
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

OTHER EDITION IN ANOTHER MEDIUM

International Standard Book Number
9780817647285

PIECE

Title
Springer eBooks

TOPICAL NAME USED AS SUBJECT

Algorithms.
Computer science.
Computer software.
Mathematics.

PERSONAL NAME - PRIMARY RESPONSIBILITY

Greene, Daniel H.

PERSONAL NAME - ALTERNATIVE RESPONSIBILITY

Knuth, Donald E.

CORPORATE BODY NAME - ALTERNATIVE RESPONSIBILITY

SpringerLink (Online service)

ORIGINATING SOURCE

Date of Transaction
20190307155400.0

ELECTRONIC LOCATION AND ACCESS

Electronic name
 مطالعه متن کتاب 

[Book]

Y

Proposal/Bug Report

Warning! Enter The Information Carefully
Send Cancel
This website is managed by Dar Al-Hadith Scientific-Cultural Institute and Computer Research Center of Islamic Sciences (also known as Noor)
Libraries are responsible for the validity of information, and the spiritual rights of information are reserved for them
Best Searcher - The 5th Digital Media Festival