![]() ![]() Complex Analysis, real analysis (at the level of at least baby rudin, and perhaps even up to functional analysis), maybe some probability up to its measure theory formulation level, and at least a smidge of abstract algebra. anyone who says that is wrong, and you should make fun of them until they cry".Īlso, If you want to dig even deeper into discrete math/ combinatorics, the value of building up a wee bit of mathematical basics in other areas of math. There are some really funny asides in it. courses/electrical-engineering-and-computer-science. ![]() I found that MIT OCW's "mathematics for Computer Scientists" notes were quite nice when I looked at them several years ago. That being said, for more introductory expositions in terms of expected mathematical maturity, I'd suggest googling around and looking at various lecture notes of the "intro to combinatorics" or "mathematics for computer scientists" sorts. Other books that are good include Enumerative combinatorics 1 and 2 by Richard P Stanley (a book which is sufficiently dense that having at least 1 analysis and algebra course each will help). Theres generatingfunctionology by wilf, free pdf version at Theres Graph Theory by Diestel, which has a free pdf version available at Theres many different areas to discrete math, and many good books.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |