New Coins From Old: Computing With Unknown Bias
暂无分享,去创建一个
[1] Peter W. Glynn,et al. Nonexistence of a class of variate generation schemes , 2003, Oper. Res. Lett..
[2] D. Marker. Model theory : an introduction , 2002 .
[3] B. Reznick,et al. A new bound for Pólya's Theorem with applications to polynomials positive on polyhedra , 2001 .
[4] D. Haskell,et al. Model theory, algebra, and geometry , 2000 .
[5] David Bruce Wilson,et al. How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph , 1998, J. Algorithms.
[6] David Bruce Wilson,et al. Exact sampling with coupled Markov chains and applications to statistical mechanics , 1996, Random Struct. Algorithms.
[7] Anand Pillay,et al. Introduction to the Model Theory of Fields , 1996 .
[8] George L. O'Brien,et al. A Bernoulli factory , 1994, TOMC.
[9] David A. Cox,et al. Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics) , 2007 .
[10] Y. Peres. Iterating Von Neumann's Procedure for Extracting Random Bits , 1992 .
[11] Andrei Z. Broder,et al. Generating random spanning trees , 1989, 30th Annual Symposium on Foundations of Computer Science.
[12] Marian Boykan Pour-El,et al. Computability in analysis and physics , 1989, Perspectives in Mathematical Logic.
[13] M-F Roy,et al. Géométrie algébrique réelle , 1987 .
[14] M. A. Dickmann,et al. Applications of model theory to real algebraic geometry , 1985 .
[15] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[16] P. Elias. The Efficient Construction of an Unbiased Random Sequence , 1972 .
[17] Chen C. Chang,et al. Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .
[18] Noam Chomsky,et al. The Algebraic Theory of Context-Free Languages* , 1963 .
[19] A. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .