Results 201 to 210 of about 3,571 (240)
Building Test Batteries Based on Analyzing Random Number Generator Tests within the Framework of Algorithmic Information Theory. [PDF]
Entropy (Basel)Ryabko B.
europepmc +1 more source
Adaptive Feedback Compensation Algorithm for Quantum Random Number Generators. [PDF]
Entropy (Basel)Deng W +5 more
europepmc +1 more source
Universal Latent Representation in Finite Ring Continuum. [PDF]
Entropy (Basel)Akhtman Y.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
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
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
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
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
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
Communications of the ACM, 2019
Tracing some of the latest advancements in algorithmic randomness.
Rod Downey, Denis R. Hirschfeldt
openaire +1 more source
Tracing some of the latest advancements in algorithmic randomness.
Rod Downey, Denis R. Hirschfeldt
openaire +1 more source
2011
AbstractCertain situations require a random rather than a deterministic strategy. With a random strategy, the choices are unpredictable and the adversary may be kept off balance. This chapter focuses on the variety and power of randomised algorithms. More specifically, it considers algorithms that find the smallest cut in a graph by combining random ...
Cristopher Moore, Stephan Mertens
openaire +1 more source
AbstractCertain situations require a random rather than a deterministic strategy. With a random strategy, the choices are unpredictable and the adversary may be kept off balance. This chapter focuses on the variety and power of randomised algorithms. More specifically, it considers algorithms that find the smallest cut in a graph by combining random ...
Cristopher Moore, Stephan Mertens
openaire +1 more source
Randomized geometric algorithms and pseudorandom generators
Algorithmica, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source