论文信息 - MATHEMATICAL ENGINEERING TECHNICAL REPORTS Derandomization in Game-Theoretic Probability - 字舞流文

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Derandomization in Game-Theoretic Probability

Akimichi Takemura | Kenshi Miyabe | A. Takemura | Kenshi Miyabe

[1] Rajeev Motwani,et al. Randomized algorithms , 1996, CSUR.

[2] Kei Takeuchi,et al. MATHEMATICAL ENGINEERING TECHNICAL REPORTS , 2006 .

[3] A. Nies. Computability and randomness , 2009 .

[4] Vladimir Vovk,et al. Prequential randomness and probability , 2010, Theor. Comput. Sci..

[5] A. Takemura,et al. Convergence of random series and the rate of convergence of the strong law of large numbers in game-theoretic probability , 2011, 1103.1426.

[6] Eli Upfal,et al. Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .

[7] Sanjeev Arora,et al. Computational Complexity: A Modern Approach , 2009 .

[8] Claude E. Shannon,et al. Computability by Probabilistic Machines , 1970 .

[9] Vladimir Vovk,et al. Kolmogorov's strong law of large numbers in game-theoretic probability: Reality's side , 2013, ArXiv.

[10] Oded Goldreich,et al. Computational complexity: a conceptual perspective , 2008, SIGA.

[11] Rodney G. Downey,et al. Algorithmic Randomness and Complexity , 2010, Theory and Applications of Computability.

[12] Verónica Becher,et al. A polynomial-time algorithm for computing absolutely normal numbers , 2013, Inf. Comput..

[13] Akimichi Takemura,et al. The generality of the zero-one laws , 2008, 0803.3679.

[14] G. Shafer,et al. Probability and Finance: It's Only a Game! , 2001 .