CS251
Map
Lectures
Part 1: Formalizing Computation
Introduction
Mathematical Reasoning and Proofs
What Is Information
Deterministic Finite Automata 1
Deterministic Finite Automata 2
Turing Machines
Universality of Computation
Limits of Counting
Limits of Computation
Limits of Human Reasoning
Part 2: Computational Complexity
Time Complexity
Introduction to Graphs
Maximum Matchings
Stable Matchings
P vs NP, Part 1
P vs NP, Part 2
Algorithms for Hard Problems
Probability Theory Basics
Randomized Algorithms Introduction
Randomized Algorithms for Cut Problems
Modular Arithmetic
Cryptography
Part 3: Highlights of Theoretical Computer Science
Extra Topics
Text
Text Overview
Part 1: Formalizing Computation
Proof-Writing Guidelines
Induction Review
Encodings and Problems
Deterministic Finite Automata
Turing Machines
Uncountable Sets
Undecidable Languages
Unprovable Truths
Part 2: Computational Complexity
Time Complexity
Introduction to Graph Theory
Matchings in Graphs
Stable Matchings
Polynomial-Time Reductions
Non-Deterministic Polynomial Time
Approximation Algorithms
Probability Theory Basics
Randomized Algorithms
Modular Arithmetic
Cryptography
Part 3: Highlights of Theoretical Computer Science
To be added...
Staff
MODULE 7
Graph Theory
Introduction to Graphs
Maximum Matchings
Stable Matchings
Introduction to Graph Theory
Matchings in Graphs
Stable Matchings
MODULE 7:
Graph Theory
Maximum Matchings
Overview:
Maximum Matchings
Close
We welcome all feedback!
Close
Loading…