Abstract
We have seen how coin flipping can help to design proofs. Randomness can also help to design quite efficient algorithms. In this chapter we will demonstrate the idea with several examples. Comprehensive guides to the state of the art of randomized algorithms are the books by Alon and Spencer (1992), and by Motwani and Raghavan (1995).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jukna, S. (2001). Randomized Algorithms. In: Extremal Combinatorics. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04650-0_27
Download citation
DOI: https://doi.org/10.1007/978-3-662-04650-0_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08559-8
Online ISBN: 978-3-662-04650-0
eBook Packages: Springer Book Archive