论文信息 - Fast Probabilistic Algorithms - 字舞流文

Fast Probabilistic Algorithms

Rusins Freivalds | R. Freivalds

[1] Sheila A. Greibach. Remarks on Blind and Partially Blind One-Way Multicounter Machines , 1978, Theor. Comput. Sci..

[2] Victor Y. Pan,et al. Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[3] Andrew C Yao. A lower bound to palindrome recognition by probabilistic Turing machines , 1977 .

[4] Volker Strassen,et al. A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..

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

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

[7] V. Strassen. Gaussian elimination is not optimal , 1969 .

[8] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[9] R. Laing,et al. REALIZATION AND COMPLEXITY OF COMMUTATIVE EVENTS. , 1967 .

[10] Seymour Ginsburg,et al. Stack automata and compiling , 1967, JACM.

[11] M. Minsky. Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .