Fast probabilistic algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 74 LNCS, Issue , 1979, Pages 57-69

  Freivalds, Rūsiņš ^a  

^a UNIVERSITY OF LATVIA   (Latvia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85034453168     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-09526-8_5     Document Type: Conference Paper

References (18)

1. BARZDIN, J. M., Complexity of symmetry recognition by Turing machines. In: Problemy kibernetiki 15, pp. 245–248, Nauka, Moscow, 1965 (Russian).
2. BUKHŠTAB, A. A., Number theory. Učpedgiz, Moscow, 1960 (Russian).
3. FISCHER, P. C., MEYER, A. R. and ROSENBERG A. L., Counter machines and counter languages. Mathematical Systems Theory, 2(1968), No. 3, 265–283.
4. FREIVALDS, R., Fast computations by probabilistic Turing machines. In: Učenye Zapiski Latviiskogo gos. universiteta, 233, pp. 201–205, Riga, 1975 (Russian).
5. FREIVALDS, R., Probabilistic machines can use less running time. In: Information Processing 77, (B. Gilchrist, Ed.), pp. 839–842, IFIP, North-Holland, 1977.
6. FREIVALDS, R., Probabilistic algorithms in proof-oriented computations. In: Proc. All-Union symposium “Artificial intelligence and automation of research in mathematics”, 102–104, Institute of Cybernetics, Kiev, 1978 (Russian).
7. GINSBURG, S., GREIBACH, S. A. and HARRISON, M. A., Stack automata and compiling. Journal of the ACM, 14 (1967), 172–201.
8. GREIBACH, S. A., Remarks on blind and partially blind one-way multicounter machines. Theoretical Computer Sciencè, 7 (1978), No. 3, 311–324.
9. KNUTH, D. E., The art of computer programming. Vol. 2. Addison-Wesley Publishing Co., Reading, Mass., 1969.
10. LIVŠIN, D. I., On a class of stack languages. In: Mathematical linguistics and theory of algorithms, (A. V. Gladkij, Ed.), pp. 113–129, Kalinin State University, Kalinin, 1978 (Russian).
11. LAING, R., Realization and complexity of commutative events. University of Michigan, Technical Report 03105-48-T, 1967.
12. LEEUW, K. de, MOORE E. F., SHANNON, C. E. and SHAPIRO, N., Computability by probabilistic machines. Automata Studies, (C. E. Shannon and J. McCarthy, Eds.), pp. 183–212, Princeton University Press, 1956.
13. MINSKY, M., Recursive unsolvability of Post’s problem of Tag and other topics in the theory of Turing machines. Annals of Mathematics, 74 (1961), 437–455.
14. PAN, V., Strassen’s algorithm is not optimal. Proc. 19th annual symposium on foundations of computer science, pp. 166–176, IEEE, 1978.
15. SOLOVAY, R. and STRASSEN, V., A fast Monte-Carlo test for primality. SIAM Journal on Computing, 6 (1977), No. 1, 84–85.
16. STRASSEN, V., Gaussian elimination is not optimal. Numerische Mathematik, 13 (1969), H. 4, 354–356.
17. TRAKHTENBROT, B. A., Remarks on the computational complexity by probabilistic machines. In: Teorija algoritmov i matematičeskaja logika, pp. 159–176, Comp. Ctr. Acad. Sci. USSR, Moscow, 1974 (Russian).
18. YAO, A. C., A lower bound to palindrome recognition by probabilistic Turing machines. STAN-CS-647, Stanford University, 1977.