Preview
Unable to display preview. Download preview PDF.
References
BARZDIN, J.M., Complexity of symmetry recognition by Turing machines. In: Problemy kibernetiki 15, pp.245–248, Nauka, Moscow, 1965 (Russian).
BUKHŠTAB, A.A., Number theory. Učpedgiz, Moscow, 1960 (Russian).
FISCHER, P.C., MEYER, A.R. and ROSENBERG A.L., Counter machines and counter languages. Mathematical Systems Theory, 2(1968), No.3, 265–283.
FREIVALDS, R., Fast computations by probabilistic Turing machines. In: Učenye Zapiski Latviiskogo gos. universiteta, 233, pp.201–205, Riga, 1975 (Russian).
FREIVALDS, R., Probabilistic machines can use less running time. In: Information Processing 77, (B.Gilchrist, Ed.), pp.839–842, IFIP, North-Holland, 1977.
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).
GINSBURG, S., GREIBACH, S.A. and HARRISON, M.A., Stack automata and compiling. Journal of the ACM, 14 (1967), 172–201.
GREIBACH, S.A., Remarks on blind and partially blind one-way multicounter machines. Theoretical Computer Sciencè, 7 (1978), No.3, 311–324.
KNUTH, D.E., The art of computer programming. Vol.2. Addison-Wesley Publishing Co., Reading, Mass., 1969.
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).
LAING, R., Realization and complexity of commutative events. University of Michigan, Technical Report 03105-48-T, 1967.
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.
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.
PAN, V., Strassen's algorithm is not optimal. Proc. 19th annual symposium on foundations of computer science, pp.166–176, IEEE, 1978.
SOLOVAY, R. and STRASSEN, V., A fast Monte-Carlo test for primality. SIAM Journal on Computing, 6 (1977), No.1, 84–85.
STRASSEN, V., Gaussian elimination is not optimal. Numerische Mathematik, 13 (1969), H.4, 354–356.
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).
YAO, A.C., A lower bound to palindrome recognition by probabilistic Turing machines. STAN-CS-647, Stanford University, 1977.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Freivalds, R. (1979). Fast probabilistic algorithms. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_5
Download citation
DOI: https://doi.org/10.1007/3-540-09526-8_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09526-2
Online ISBN: 978-3-540-35088-0
eBook Packages: Springer Book Archive