Introduction to Theoretical Computer Science

开始时间: 随时 持续时间: 自主

所在平台: Udacity

课程类别: 计算机科学

大学或机构: Udacity Self

   

课程主页: https://www.udacity.com/course/cs313

Explore 1600+ online courses from top universities. Join Coursera today to learn data science, programming, business strategy, and more.

课程评论: 1 个评论

评论课程        关注课程

课程详情

At the end of this course, you will have a solid understanding of theoretical computer science. This will not only allow you to recognize some of the most challenging algorithmic problems out there, but also give you powerful tools to deal with them in practice.

Lesson 1: Challenging Problems
An introduction to tough problems and their analysis

Lesson 2: Understanding Hardness
What we mean when a problem is “hard” and the concept of NP-completeness

Lesson 3: Showing Hardness
Tools to let you recognize and prove that a problem is hard

Lesson 4: Intelligent Force
Smart techniques to solve problems that should – theoretically – be impossible to solve

Lesson 5: Sloppy Solutions
Gaining speed by accepting approximate solutions

Lesson 6: Poking Around
Why randomness can be of help – sometimes. An introduction to complexity classes.

Lesson 7: Ultimate Limits
Problems that no computer can ever solve. In theory.

课程评论(1条)

0

wzyer 2013-05-22 16:12 0 票支持; 0 票反对

讲计算理论的,但是也不显得很理论。主要围绕P和NP的话题展开,还是偏应用一些的。课程的主旨就是要你在面对NP问题的时候不那么慌,可以去尝试一些近似的或是一些概率性的算法。还是不错的课程,不过我也没有深入研究。

Deep Learning Specialization on Coursera

课程简介

This class teaches you about basic concepts in theoretical computer science -- such as NP-completeness -- and what they imply for solving tough algorithmic problems.

课程标签

计算机 计算机科学 计算机理论 NP问题

5人关注该课程

主题相关的课程

Software Debugging 关注

Software Testing 关注

Algorithms 关注

Design of Computer Programs 关注

Artificial Intelligence for Robotics 关注

Functional Hardware Verification 关注

Applied Cryptography 关注

Interactive 3D Graphics 关注

Introduction to Programming in Java 关注

Visualizing Algebra (Entry-Level Mathematics) 关注