What I Learned About Theoretical CS at Cracker Barrel
Connecting the well-known peg game with SMT solvers, Turing machines, and NP-completeness. Presented to HSV.py.
#complexity
Content tagged with "complexity"
What I Learned About Theoretical CS at Cracker Barrel
Connecting the well-known peg game with SMT solvers, Turing machines, and NP-completeness. Presented to UAH ACM-W.
CS317: Introduction to Design & Analysis of Algorithms
Complexity analysis; searching, sorting, finding spanning trees and shortest paths in graphs. Divide & conquer, dynamic programming, and backtracking. Intro to problem classification, i.e., NP, intractable, and unsolvable.