Title of article
Randomized Algorithms and Complexity Theory
Author/Authors
Hempel, Harald Friedrich-Schiller-Universitat, Germany
From page
746
To page
761
Abstract
In this paper we give an introduction to the connection between complexitytheory and the study of randomized algorithms. In particular, we will define and studyprobabilistic complexity classes, survey the basic results, and show how they relate tothe notion of randomized algorithms
Keywords
Randomized algorithms , randomized complexity classes
Journal title
Journal of J.UCS (Journal of Universal Computer Science)
Journal title
Journal of J.UCS (Journal of Universal Computer Science)
Record number
2660450
Link To Document