-
From CS Largeclass
- 3SAT to hamiltonian cycle - 3SAT to graph coloring - 3SAT to CSAT (and reverse too!) -
From CS Largeclass
-Sample reduction from SAT to independent set -Re-review of complexity classes -P/NP comparison to DFA/NFA -Introduction to certificate and certificate jargon -
-
-
From Andrew Miller
Greedy algorithms and exchange proofs of optimality - Interval scheduling - Minimum max-lateness -
-
-
From Andrew Miller
- Code example of Optimal Binary Search Tree example - Parsing and the CYK algorithm -
-
From Andrew Miller
- Dynamic programming - Improving solution to SubsetSum - A look at the rubrics and step by step guide to dynamic programming solutions -
From Andrew Miller
- Brute force strategies - Backtracking strategies - 8 queens, subset sum - Memoization & fibonacci -
-
-
From Andrew Miller
- Proving languages non-regular with fooling sets - Proving languages non-regular with Closure Properties - A bit about the Myhill-Nerode theorems -
-
From Andrew Miller
Finish up regexes A coding example using regexp library! Start talking about DFAs -
From Andrew Miller
Reviewing strings Some inductive proofs Facts about languages and a first result in computability theory Introducing regular languages / expressions -
Search for ""
Public, Restricted and Moderated
- Managers: