Probability and Algorithms

Status: Available Now

Size: 188 pages, 8.5 x 11

Publication Year:1992

Print	List Price


PAPERBACK ISBN-10: 0-309-04776-5 ISBN-13: 978-0-309-04776-0	$52.75	Add to Cart

PDF			About PDF

Authors:
Panel on Probability and Algorithms, National Research Council
Authoring Organizations

Description:
Some of the hardest computational problems have been successfully attacked through the use of probabilistic algorithms, which have an element of randomness to them. Concepts from the field of probability are also increasingly useful in analyzing the performance of algorithms, ...
Read More

Reviews:
"The papers in this collection . . . are still full of interest." --American Scientist
...
Read More

Paste into your Web page:

<!-- Start NAP Book Display -->
<object classid="clsid:d27cdb6e-ae6d-11cf-96b8-444553540000" codebase="http://download.macromedia.com/pub/shockwave/cabs/flash/swflash.cab#version=8,0,0,0" width="175" height="250" id="napbookwrapper" align="middle">
<param name="allowScriptAccess" value="always" />
<param name="movie" value="http://www.nap.edu/napbookwrapper.swf" />
<param name="quality" value="high" />
<param name="wmode" value="transparent" />
<param name="flashvars" value="wid=10721186382013052404100&record_id=2026" />
<embed src="http://www.nap.edu/napbookwrapper.swf" quality="high" flashvars="wid=10721186382013052404100&record_id=2026" wmode="transparent" bgcolor="#ffffff" width="175" height="250" name="napbookwrapper" align="middle" allowScriptAccess="always" allowFullScreen="false" type="application/x-shockwave-flash" pluginspage="http://www.macromedia.com/go/getflashplayer"></embed>
</object>

Preview

Free Resources

Full Text
Jump to this book's table of contents to begin reading online for free.

Related Items:
Related Titles

No free downloads available for this title.

Reprint Permission
Request permission to license or reprint the book's content through Copyright Clearance Center's Rightslink.

Request Permission to Distribute a PDF

Request Translation Rights

Questions About Rights and Permissions?

Table of Contents
Select a link below to start reading online free!
Front Matter	i-x
1 Introduction	1-16	(skim)
2 Simulated Annealing	17-30	(skim)
3 Approximate Counting Via Markov Chains	31-38	(skim)
4 Probabilistic Algorithms for Speedup	39-52	(skim)
5 Probabilistic Algorithms for Defeating Adversaries	53-64	(skim)
6 Pseudorandom Numbers	65-86	(skim)
7 Probabilistic Analysis of Packing and Related Partitioning Problems	87-108	(skim)
8 Probability and Problems in Euclidean Combinatorial Optimization	109-130	(skim)
9 Probabilistic Analysis in Linear Programming	131-148	(skim)
10 Randomization in Parallel Algorithms	149-160	(skim)
11 Randomly Wired Multistage Networks	161-174	(skim)
12 Missing Pieces, Derandomization, and Concluding Remarks	175-178	(skim)

Description

Some of the hardest computational problems have been successfully attacked through the use of probabilistic algorithms, which have an element of randomness to them. Concepts from the field of probability are also increasingly useful in analyzing the performance of algorithms, broadening our understanding beyond that provided by the worst-case or average-case analyses.
This book surveys both of these emerging areas on the interface of the mathematical sciences and computer science. It is designed to attract new researchers to this area and provide them with enough background to begin explorations of their own.

Reviews

"The papers in this collection . . . are still full of interest." --American Scientist

Probability and Algorithms

Citation Manager

Description

Reviews

Authoring Organizations

Search This Book

SIGN UP FOR...