Abstract
A randomized algorithm can be viewed as a nondeterministic algorithm that has a probability distribution for every nondeterministic choice. To simplify the matter one usually considers only the random choices from two possibilities, each with the probability 1/2. Another possibility is to consider a randomized algorithm as a deterministic algorithm with an additional input that consists of a sequence of random bits. In other words, a randomized algorithm may be seen as a set of deterministic algorithms, from which one algorithm is randomly chosen for the given input.
“For him who seeks the truth, an error is nothing unknown.”
Johann Wolfgang von Goethe
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
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hromkovič, J. (2004). Randomized Algorithms. In: Algorithmics for Hard Problems. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-05269-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-05269-3_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07909-2
Online ISBN: 978-3-662-05269-3
eBook Packages: Springer Book Archive