Algorithms for Hard Problems | Lectures | CS251 Spring 2023

CS251

Docs
Lectures
- 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
- Time Complexity
- Introduction to Graphs
- Maximum Matchings
- Stable Matchings
- P vs NP, Part 1
- P vs NP, Part 2
- Probability Theory Basics 1
- Probability Theory Basics 2
- Randomized Algorithms Introduction
- Randomized Algorithms for Cut Problems
- Modular Arithmetic
- Cryptography
- Algorithms for Hard Problems
- Extra Topics
- Quantum Computation
Text
- Text Overview
- Proof-Writing Guidelines
- Induction Review
- Encodings and Problems
- Deterministic Finite Automata
- Turing Machines
- Uncountable Sets
- Undecidable Languages
- Unprovable Truths
- Time Complexity
- Introduction to Graph Theory
- Matchings in Graphs
- Stable Matchings
- Polynomial-Time Reductions
- Non-Deterministic Polynomial Time
- Probability Theory Basics
- Randomized Algorithms
- Modular Arithmetic
- Cryptography
Recitations
- Recitation - Introduction
- Recitation - Finite Automata
- Recitation - Turing Machines
- Recitation - Undecidability
- Recitation - Complexity and Graphs
- Recitation - NP
- Recitation - Probability
- Recitation - Randomized Algorithms
- Recitation - Cryptography
Links
Calendar

MODULE 11

Extra Topics

Algorithms for Hard Problems

Quantum Computation

MODULE 11: Extra Topics

Algorithms for Hard Problems

Video

Slides

Overview: Algorithms for Hard Problems

We welcome all feedback!