Mathematics for Computer Science
Discrete mathematical foundations for theoretical computer science: proof techniques, well-ordering, number theory, RSA cryptography, graph theory, recurrences, generating functions, and discrete probability.
Tom Leighton
Professor of Applied Mathematics
Courses by Tom Leighton
Complete university lecture series taught by Tom Leighton.
Study paths featuring Tom Leighton
1
6 steps · 5h5 universities
Probability, Primes & Computational Hardness
Discrete proof invariants, stochastic conditioning, pseudorandomness, and P vs. NP
MIT · Harvard University · UCLA +2
6 curated lecturesOpen path →
All lectures by Tom Leighton
17Search or browse every recorded session across courses and talks.
Showing 17 of 17 lectures
Lecturej/k navigate · c chapters · s save · x watched
Scholar · University
Chapters · Duration
6.042J · Lec 1 · Tom Leighton · MIT
44:09
6.042J · Lec 14 · Tom Leighton · MIT
1:22:46
6.042J · Lec 2 · Tom Leighton · MIT
1:19:25
6.042J · Lec 8 · Tom Leighton · MIT
1:23:26
1:22:51
1:22:40
6.042J · Lec 19 · Tom Leighton · MIT
1:21:46
6.042J · Lec 18 · Tom Leighton · MIT
1:23:56
