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
 Pass condition
Grade:70 Fraction
  • undefined
  • undefined
  • undefined
  • undefined
  • undefined
  • undefined
  • undefined
  • undefined
  • undefined
  • undefined
Instructor
丁德榮
Recommended Courses
  • 1121-Artificial Intelligence-54022
    Period:2023-08-01~2024-01-31
    LINE sharing feature only supports mobile devices
  • 1121-Computer Algorithms-54017
    Period:2023-08-01~2024-01-31
    LINE sharing feature only supports mobile devices
  • 1082-Research on Network Communication Ⅱ-54039
    Period:2020-02-01~2020-07-31
    LINE sharing feature only supports mobile devices
  • 1081-Computer Algorithms-54022
    Period:2019-08-01~2020-01-31
    LINE sharing feature only supports mobile devices
  • 992-Computer Algorithms-54010
    Period:2011-02-07~2011-07-31
    LINE sharing feature only supports mobile devices


LINE sharing feature only supports mobile devices