課程信息
26,238 次近期查看

第 5 門課程(共 6 門)

100% 在線

立即開始,按照自己的計劃學習。

可靈活調整截止日期

根據您的日程表重置截止日期。

高級

完成時間大約為23 小時

建議:4 weeks of study, 4-8 hours/week...

英語(English)

字幕:英語(English)
User
學習Course的學生是
  • Machine Learning Engineers
  • Data Scientists
  • Software Engineers
  • Scientists
  • Data Engineers

您將獲得的技能

Python ProgrammingLinear Programming (LP)Np-CompletenessDynamic Programming
User
學習Course的學生是
  • Machine Learning Engineers
  • Data Scientists
  • Software Engineers
  • Scientists
  • Data Engineers

第 5 門課程(共 6 門)

100% 在線

立即開始,按照自己的計劃學習。

可靈活調整截止日期

根據您的日程表重置截止日期。

高級

完成時間大約為23 小時

建議:4 weeks of study, 4-8 hours/week...

英語(English)

字幕:英語(English)

教學大綱 - 您將從這門課程中學到什麼

1
完成時間為 5 小時

Flows in Networks

9 個視頻 (總計 72 分鐘), 3 個閱讀材料, 2 個測驗
9 個視頻
Network Flows9分鐘
Residual Networks10分鐘
Maxflow-Mincut7分鐘
The Ford–Fulkerson Algorithm7分鐘
Slow Example3分鐘
The Edmonds–Karp Algorithm11分鐘
Bipartite Matching11分鐘
Image Segmentation7分鐘
3 個閱讀材料
Slides and Resources on Flows in Networks10分鐘
Available Programming Languages10分鐘
FAQ on Programming Assignments10分鐘
1 個練習
Flow Algorithms10分鐘
2
完成時間為 5 小時

Linear Programming

10 個視頻 (總計 84 分鐘), 1 個閱讀材料, 2 個測驗
10 個視頻
Linear Programming8分鐘
Linear Algebra: Method of Substitution5分鐘
Linear Algebra: Gaussian Elimination10分鐘
Convexity9分鐘
Duality12分鐘
(Optional) Duality Proofs7分鐘
Linear Programming Formulations8分鐘
The Simplex Algorithm10分鐘
(Optional) The Ellipsoid Algorithm6分鐘
1 個閱讀材料
Slides and Resources on Linear Programming10分鐘
1 個練習
Linear Programming Quiz10分鐘
3
完成時間為 6 小時

NP-complete Problems

16 個視頻 (總計 115 分鐘), 2 個閱讀材料, 2 個測驗
16 個視頻
Search Problems9分鐘
Traveling Salesman Problem7分鐘
Hamiltonian Cycle Problem8分鐘
Longest Path Problem1分鐘
Integer Linear Programming Problem3分鐘
Independent Set Problem3分鐘
P and NP4分鐘
Reductions5分鐘
Showing NP-completeness6分鐘
Independent Set to Vertex Cover5分鐘
3-SAT to Independent Set14分鐘
SAT to 3-SAT7分鐘
Circuit SAT to SAT12分鐘
All of NP to Circuit SAT5分鐘
Using SAT-solvers14分鐘
2 個閱讀材料
Slides and Resources on NP-complete Problems10分鐘
Minisat Installation Guide10分鐘
1 個練習
NP-complete Problems12分鐘
4
完成時間為 5 小時

Coping with NP-completeness

11 個視頻 (總計 119 分鐘), 1 個閱讀材料, 2 個測驗
11 個視頻
2-SAT10分鐘
2-SAT: Algorithm12分鐘
Independent Sets in Trees14分鐘
3-SAT: Backtracking11分鐘
3-SAT: Local Search12分鐘
TSP: Dynamic Programming15分鐘
TSP: Branch and Bound9分鐘
Vertex Cover9分鐘
Metric TSP12分鐘
TSP: Local Search6分鐘
1 個閱讀材料
Slides and Resources on Coping with NP-completeness10分鐘
1 個練習
Coping with NP-completeness6分鐘
4.6
75 個審閱Chevron Right

29%

完成這些課程後已開始新的職業生涯

50%

通過此課程獲得實實在在的工作福利

25%

加薪或升職

來自Advanced Algorithms and Complexity的熱門評論

創建者 EMJan 4th 2018

As usual, complex arguments explained in simple terms!\n\nSome problems are really tough! (e.g. there's a problem from Google Code Jam).\n\nThank you for this course!

創建者 CSAug 26th 2019

Very Very Challenging Course , it test your patience and rewards is extremely satisfying. Lot of learning on a complicated subject of NP-Hard problems.

講師

Avatar

Alexander S. Kulikov

Visiting Professor
Department of Computer Science and Engineering
Avatar

Michael Levin

Lecturer
Computer Science
Avatar

Daniel M Kane

Assistant Professor
Department of Computer Science and Engineering / Department of Mathematics
Avatar

Neil Rhodes

Adjunct Faculty
Computer Science and Engineering

關於 加州大学圣地亚哥分校

UC San Diego is an academic powerhouse and economic engine, recognized as one of the top 10 public universities by U.S. News and World Report. Innovation is central to who we are and what we do. Here, students learn that knowledge isn't just acquired in the classroom—life is their laboratory....

關於 国立高等经济大学

National Research University - Higher School of Economics (HSE) is one of the top research universities in Russia. Established in 1992 to promote new research and teaching in economics and related disciplines, it now offers programs at all levels of university education across an extraordinary range of fields of study including business, sociology, cultural studies, philosophy, political science, international relations, law, Asian studies, media and communicamathematics, engineering, and more. Learn more on www.hse.ru...

關於 数据结构与算法 專項課程

This specialization is a mix of theory and practice: you will learn algorithmic techniques for solving various computational problems and will implement about 100 algorithmic coding problems in a programming language of your choice. No other online course in Algorithms even comes close to offering you a wealth of programming challenges that you may face at your next job interview. To prepare you, we invested over 3000 hours into designing our challenges as an alternative to multiple choice questions that you usually find in MOOCs. Sorry, we do not believe in multiple choice questions when it comes to learning algorithms...or anything else in computer science! For each algorithm you develop and implement, we designed multiple tests to check its correctness and running time — you will have to debug your programs without even knowing what these tests are! It may sound difficult, but we believe it is the only way to truly understand how the algorithms work and to master the art of programming. The specialization contains two real-world projects: Big Networks and Genome Assembly. You will analyze both road networks and social networks and will learn how to compute the shortest route between New York and San Francisco (1000 times faster than the standard shortest path algorithms!) Afterwards, you will learn how to assemble genomes from millions of short fragments of DNA and how assembly algorithms fuel recent developments in personalized medicine....
数据结构与算法

常見問題

  • 注册以便获得证书后,您将有权访问所有视频、测验和编程作业(如果适用)。只有在您的班次开课之后,才可以提交和审阅同学互评作业。如果您选择在不购买的情况下浏览课程,可能无法访问某些作业。

  • 您注册课程后,将有权访问专项课程中的所有课程,并且会在完成课程后获得证书。您的电子课程证书将添加到您的成就页中,您可以通过该页打印您的课程证书或将其添加到您的领英档案中。如果您只想阅读和查看课程内容,可以免费旁听课程。

還有其他問題嗎?請訪問 學生幫助中心