参考文献
[1]
Martin Aigner and Günter M Ziegler. Proofs from The Book. Springer-Verlag, 1999. MR1723092.
[2]
Tom M. Apostol. Calculus, Vol. 1. Wiley & Sons, 1967.
[3]
Eric Bach and Jeffrey Shallit. Efficient Algorithms, volume 1 of Algorithmic Number Theory. The MIT Press, 1996.
[4]
John Beam. A powerful method of non-proof. College Mathematics Journal, 48(1):52–54, 2017.
[5]
Edward A. Bender and S. Gill Williamson. A Short Course in Discrete Mathematics. Dover Publications, 2005.
[6]
Arthur T. Benjamin and Jennifer J. Quinn. Proofs That Really Count: The Art of Combinatorial Proof. The Mathematical Association of America, 2003.
[7]
P. J. Bickel, E. A. Hammel, and J. W. O'Connell. Sex bias in graduate admissions: Data from Berkeley. Science, 187(4175):398–404, 1975.
[8]
Norman L. Biggs. Discrete Mathematics. Oxford University Press, second edition, 2002.
[9]
Béla Bollobás. Modern Graph Theory, volume 184 of Graduate Texts in Mathematics. Springer-Verlag, 1998. MR1633290.
[10]
Miklós Bóna. Introduction to Enumerative Combinatorics. Walter Rudin Student Series in Advanced Mathematics. McGraw Hill Higher Education, 2007. MR2359513.
[11]
George S. Boolos and Richard C. Jeffrey. Computability and Logic. Cambridge University Press, 1974.
[12]
Timothy Y. Chow. The surprise examination or unexpected hanging paradox. American Mathematical Monthly, pages 41–51, 1998.
[13]
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms. The MIT Press, third edition, 2009.
[14]
Antonella Cupillari. The Nuts and Bolts of Proofs. Academic Press, fourth edition, 2012. MR1818534.
[15]
Reinhard Diestel. Graph Theory. Springer-Verlag, second edition, 2000.
[16]
Michael Paterson et al. Maximum overhang. MAA Monthly, 116:763–787, 2009.
[17]
Shimon Even. Algorithmic Combinatorics. Macmillan, 1973.
[18]
Ronald Fagin, Joseph Y. Halpern, Yoram Moses, and Moshe T. Vardi. Reasoning About Knowledge. MIT Press, 1995.
[19]
William Feller. An Introduction to Probability Theory and Its Applications. Vol. I. John Wiley & Sons Inc., New York, third edition, 1968. MR0228020.
[20]
Philippe Flajolet and Robert Sedgewick. Analytic Combinatorics. Cambridge Univ. Press, 2009.
[21]
Michael Garey and David Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness . W. H. Freeman and Company, 1979.
[22]
A. Gelfond. Sur le septième problème de Hilbert. Bulletin de l'Académie des Sciences de l'URSS, 4:623–634, 1934.
[23]
Judith L. Gersting. Mathematical Structures for Computer Science: A Modern Treatment of Discrete Mathematics. W. H. Freeman and Company, fifth edition, 2003.
[24]
Edgar G. Goodaire and Michael M. Parmenter. Discrete Mathematics with Graph Theory. Prentice Hall, second edition, 2001.
[25]
Ronald L. Graham, Donald E. Knuth, and Oren Patashnik. Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley, second edition, 1994.
[26]
Charles M. Grinstead and J. Laurie Snell. Introduction to Probability. American Mathematical Society, second revised edition, 1997.
[27]
Dan Gusfield and Robert W. Irving. The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge, Massachusetts, 1989.
[28]
Gary Haggard, John Schlipf, and Sue Whitesides. Discrete Mathematics for Computer Science. Brooks Cole, 2005.
[29]
Nora Hartsfield and Gerhard Ringel. Pearls in Graph Theory: A Comprehensive Introduction. Dover Publications, 2003.
[30]
Gregory F. Lawler and Lester N. Coyle. Lectures on Contemporary Probability. American Mathematical Society, 1999.
[31]
Eric Lehman, Tom Leighton, and Albert R. Meyer. Mathematics for Computer Science. unpublished notes for class MIT 6.042, 2017.
[32]
L. Lovász, J. Pelikán and K. Vesztergombi. Discrete Mathematics: Elementary and Beyond. Undergraduate Texts in Mathematics. Springer-Verlag, 2003. MR1952453.
[33]
Michael Machtey and Paul Young. An Introduction to the General Theory of Algorithms. Elsevier North-Holland, 1978.
[34]
Burton Gordon Malkiel. A Random Walk down Wall Street: The Time-tested Strategy for Success. W. W. Norton, 2003.
[35]
Yuri V. Matiyasevich. Hilbert's Tenth Problem. MIT Press, 1993.
[36]
Albert R. Meyer. A note on star-free events. J. Assoc. Comput. Machinery, 16(2), 1969.
[37]
John G. Michaels and Kenneth H. Rosen. Applications of Discrete Mathematics. McGraw-Hill, 1991.
[38]
Michael Mitzenmacher and Eli Upfal. Probability and Computing: Randomized algorithms and probabilistic analysis. Cambridge University Press, 2005. MR2144605.
[39]
Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, 1995. MR1344451,.
[40]
G. Pólya. How to Solve It: A New Aspect of Mathematical Method. Princeton University Press, second edition, 1971.
[41]
Kenneth H. Rosen. Discrete Mathematics and Its Applications. McGraw Hill Higher Education, fifth edition, 2002.
[42]
Sheldon M. Ross. A First Course in Probability. Prentice Hall, sixth edition, 2002.
[43]
Sheldon M. Ross. Probability Models for Computer Science. Academic Press, 2001.
[44]
Edward A. Scheinerman. Mathematics: A Discrete Introduction. Brooks Cole, third edition, 2012.
[45]
Victor Shoup. A Computational Introduction to Number Theory and Algebra. Cambridge University Press, 2005.
[46]
Larry Stockmeyer. Planar 3-colorability is polynomial complete. ACM SIGACT News, pages 19–25, 1973.
[47]
Gilbert Strang. Introduction to Applied Mathematics. Wellesley-Cambridge Press, Wellesley, Massachusetts, 1986.
[48]
Michael Stueben and Diane Sandford. Twenty Years Before the Blackboard. Mathematical Association of America, 1998.
[49]
Daniel J. Velleman. How To Prove It: A Structured Approach. Cambridge University Press, 1994.
[50]
Herbert S. Wilf. generatingfunctionology. Academic Press, 1990.
[51]
David Williams. Weighing the Odds. Cambridge University Press, 2001. MR1854128.
[52]
Jonathan Schaeffer, Neil Burch, Yngvi Bjornsson, Akihiro Kishimoto, Martin Müller, Robert Lake, Paul Lu, and Steve Sutphen. Checkers is Solved. Science 317, 5844 (2007), 1518–1522.