论文信息 - Why Sometimes Probabilistic Algorithms Can Be More Effective - 字舞流文

Why Sometimes Probabilistic Algorithms Can Be More Effective

Rusins Freivalds | Farid M. Ablayev | R. Freivalds | F. Ablayev

[1] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1951 .

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

[3] Paavo Turakainen,et al. On probabilistic automata and their generalizations , 1969 .

[4] Richard Edwin Stearns,et al. Hierarchies of memory limited computations , 1965, SWCT.

[5] Rusins Freivalds,et al. Probabilistic Two-Way Machines , 1981, MFCS.

[6] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .

[7] A. Gladkii. Formal Grammars and Languages , 1978 .

[8] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..

[9] Rusins Freivalds,et al. Probabilistic Machines Can Use Less Running Time , 1977, IFIP Congress.