<span>This book makes a substantial contribution to the understanding of a murky area of number theory that is important to computer science, an area relevant to the design and analysis of number-theoretic algorithms and to the construction of cryptographic protocols.<br><br></span><span>Contents:</
Statistical methods in algorithm design and analysis (thesis)
β Scribed by Weide B.W.
- Year
- 1978
- Tongue
- English
- Leaves
- 190
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
The use of statistical methods In the design and analysis of discrete algorithms is explored. Among the design tools are randomization, ranking, sampling and subsampling, density estimation, and "cell" or "bucket" techniques. The analysis techniques include those based on the design methods as well as the use of stochastic convergence concepts and order statistics.
π SIMILAR VOLUMES
<i>Numerical Methods</i> provides a clear and concise exploration of standard numerical analysis topics, as well as nontraditional ones, including mathematical modeling, Monte Carlo methods, Markov chains, and fractals. Filled with appealing examples that will motivate students, the textbook conside
<p> <i>Numerical Methods</i> provides a clear and concise exploration of standard numerical analysis topics, as well as nontraditional ones, including mathematical modeling, Monte Carlo methods, Markov chains, and fractals. Filled with appealing examples that will motivate students, the textbook con
Explores the Impact of the Analysis of Algorithms on Many Areas within and beyond Computer Science A flexible, interactive teaching format enhanced by a large selection of examples and exercises Developed from the authorβs own graduate-level course, Methods in Algorithmic Analysis presents numerous
<P>...helpful to any mathematics student who wishes to acquire a background in classical probability and analysis ... This is a remarkably beautiful book that would be a pleasure for a student to read, or for a teacher to make into a year's course.<BR><BR>-Harvey Cohn, <EM>Computing Reviews</EM>, Ma