undefined

Registration：Now ~ Any Time
Course Period：2020-02-03 ~ 2020-07-18

This course introduces techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics: Randomized algorithms, Divide-and-Conquer; Greedy method, Dynamic programming, Backtracking, Branch-and-bound; graph algorithms; NP-complete problems. The aim of this course is to have a more detailed study of efficient algorithms for computational problems.
並配合台灣師範大學演算法開課之課綱增修至少包含
	Introduction
	Lower Bounds (Complexity)
	Greedy Method
	Divide-&-Conquer Strategy
	Searching Method (Branch-&-Bound Strategy)
	Prune-&-Search Strategy
	Dynamic Programming Strategy
	NP-Completeness
	Branch-&-Bound Strategy