Randomized Algorithms and Complexity Theory
|
|
|
|
|
|
|
|
نویسنده
|
Hempel Harald
|
|
منبع
|
journal of universal computer science - 2006 - دوره : 12 - شماره : 6 - صفحه:746 -761
|
|
چکیده
|
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
|
|
کلیدواژه
|
Randomized algorithms ,randomized complexity classes
|
|
آدرس
|
Friedrich-Schiller-Universitat, Germany
|
|
پست الکترونیکی
|
hempel@informatik.uni-jena.de
|
|
|
|
|
|
|