Jump to ContentJump to Main Navigation
The Nature of Computation$
Users without a subscription are not able to see the full content.

Cristopher Moore and Stephan Mertens

Print publication date: 2011

Print ISBN-13: 9780199233212

Published to Oxford Scholarship Online: December 2013

DOI: 10.1093/acprof:oso/9780199233212.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 18 November 2019

Randomized Algorithms

Randomized Algorithms

Chapter:
(p.450) (p.451) Chapter 10 Randomized Algorithms
Source:
The Nature of Computation
Author(s):

Cristopher Moore

Stephan Mertens

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780199233212.003.0010

Certain situations require a random rather than a deterministic strategy. With a random strategy, the choices are unpredictable and the adversary may be kept off balance. This chapter focuses on the variety and power of randomised algorithms. More specifically, it considers algorithms that find the smallest cut in a graph by combining random vertices until only two remain, or play games by searching the tree of possible moves in random order. It also explains how to check whether the software on a space probe is uncorrupted, how to turn a puzzle with many solutions into one with a unique solution, and how to determine whether two functions are equal. It describes tools such as random hash functions and polynomial identity testing, analyzes the nature of the primes, and looks at a series of randomised algorithms for primality based on different number-theoretic ideas. The chapter concludes by discussing several complexity classes consisting of problems that can be solved using various kinds of randomized algorithms in polynomial time.

Keywords:   randomised algorithms, solutions, random hash functions, polynomial identity testing, primes, primality, games, complexity classes, polynomial time

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .