BIBLIOGRAPHY897
[29] L. Lov ́asz, Pelik ́an J. and K. Vesztergombi. Discrete Mathematics: Ele-
mentary and Beyond. Undergraduate Texts in Mathematics. Springer-Verlag,
- MR1952453. 449
[30] Burton Gordon Malkiel.A Random Walk down Wall Street: The Time-tested
Strategy for Success. W. W. Norton, 2003. 690
[31] Yuri V. Matiyasevich.Hilbert’s Tenth Problem. MIT Press, 1993. 293
[32] Albert R. Meyer. A note on star-free events.J. Assoc. Comput. Machinery,
16(2), 1969. 102
[33] John G. Michaels and Kenneth H. Rosen. Applications of Discrete Mathe-
matics. McGraw-Hill, 1991.
[34] Michael Mitzenmacher and Eli Upfal. Probability and Computing: Ran-
domized algorithms and probabilistic analysis. Cambridge University Press,
- MR2144605. 690
[35] Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cam-
bridge University Press, 1995. MR1344451,. 690
[36] G. Polya.How to Solve It: A New Aspect of Mathematical Method. Princeton
University Press, second edition, 1971.
[37] Kenneth H. Rosen.Discrete Mathematics and Its Applications. McGraw Hill
Higher Education, fifth edition, 2002.
[38] Sheldon Ross. A First Course in Probability. Prentice Hall, sixth edition,
- 690
[39] Sheldon M. Ross.Probability Models for Computer Science. Academic Press,
- 690
[40] Edward A. Scheinerman. Mathematics: A Discrete Introduction. Brooks
Cole, third edition, 2012.
[41] Victor Shoup.A Computational Introduction to Number Theory and Algebra.
Cambridge University Press, 2005. 282
[42] Larry Stockmeyer. Planar 3-colorability is polynomial complete. ACM
SIGACT News, pages 19–25, 1973. 455
[43] Gilbert Strang. Introduction to Applied Mathematics. Wellesley-Cambridge
Press, Wellesley, Massachusetts, 1986.