Skip to content

CS 170. Efficient Algorithms and Intractable Problems: Concept and basic techniques in the design and analysis of algorithms; models of computation; lower bounds; algorithms for optimum search trees, balanced trees and UNION-FIND algorithms; numerical and algebraic algorithms; combinatorial algorithms. Turing machines, how to count steps, determ…

Notifications You must be signed in to change notification settings

codeatblack/cs170

About

CS 170. Efficient Algorithms and Intractable Problems: Concept and basic techniques in the design and analysis of algorithms; models of computation; lower bounds; algorithms for optimum search trees, balanced trees and UNION-FIND algorithms; numerical and algebraic algorithms; combinatorial algorithms. Turing machines, how to count steps, determ…

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages