Results 221 to 230 of about 348,702 (282)

Randomized algorithms

ACM Computing Surveys, 1995
For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This book introduces the basic concepts in the design and analysis of randomized algorithms. The first part of the text presents basic tools such as probability theory and probabilistic analysis that are frequently used in ...
Rajeev Motwani, Prabhakar Raghavan
openaire   +2 more sources

Algorithms and Randomness

Theory of Probability & Its Applications, 1988
This paper is one of the last works of A. N. Kolmogorov who was the founder of many branches of probability theory. (Kolmogorov died on October 20, 1987.) He was one of the initiators of the algorithmic definition of randomness. His brilliant ideas influenced very deeply this area which had also profound implications for other fields of science from ...
Kolmogorov, A. N., Uspenskij, V. A.
openaire   +3 more sources

Algorithmically random series

Computability, 2023
Rademacher (Mathematische Annalen 87 (1922) 112–138), Steinhaus (Mathematische Zeitschrift 31 (1930) 408–416) and Paley and Zygmund (Mathematical Proceedings of the Cambridge Philosophical Society 26 (1930) 337–257, Mathematical Proceedings of the Cambridge Philosophical Society 26 (1930) 458–474, Mathematical Proceedings of the Cambridge Philosophical
Downey, Rodney G.   +2 more
openaire   +1 more source

Algorithmic randomness

Communications of the ACM, 2019
Tracing some of the latest advancements in algorithmic randomness.
Rod Downey, Denis R. Hirschfeldt
openaire   +1 more source

Home - About - Disclaimer - Privacy