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.
Marten van Dijk
Professor
Courses by Marten van Dijk
Complete university lecture series taught by Marten van Dijk.
All lectures by Marten van Dijk
5Search or browse every recorded session across courses and talks.
Showing 5 of 5 lectures
Lecturej/k navigate · c chapters · s save · x watched
Scholar · University
Chapters · Duration
6.042J · Lec 10 · Marten van Dijk · MIT
1:22:50
6.042J · Lec 17 · Marten van Dijk · MIT
1:25:24
6.042J · Lec 9 · Marten van Dijk · MIT
1:23:25
6.042J · Lec 16 · Marten van Dijk · MIT
1:20:02
6.042J · Lec 11 · Marten van Dijk · MIT
1:04:00